A design methodology for verified web-service mediators. | 0 | 0.34 | 2013 |
A Markov Performance Model for Buffered Protocol Design | 3 | 0.40 | 2011 |
High-fidelity markovian power model for protocols | 4 | 0.48 | 2010 |
A Markov Model for Low-Power High-Fidelity Design-Space Exploration | 2 | 0.40 | 2010 |
The 'Best' Valid Safe Protocol Converter | 3 | 0.43 | 2010 |
Heuristic Sensitivity in Guided Random-Walk Based Model Checking | 1 | 0.36 | 2009 |
Formal model of a protocol converter | 5 | 0.51 | 2009 |
Formal Verification Based on Guided Random Walks | 2 | 0.42 | 2009 |
Formally Synthesising a Protocol Converter: A Case Study | 3 | 0.43 | 2009 |
The spin on guided random search in verification | 1 | 0.35 | 2008 |
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis | 2 | 0.39 | 2006 |
Experiments with multiple abstraction heuristics in symbolic verification | 3 | 0.40 | 2005 |
Abstraction-Guided model checking using symbolic IDA* and heuristic synthesis | 7 | 0.45 | 2005 |
Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases | 32 | 1.10 | 2004 |
Abstraction-Based Model Checking Using Heuristical Refinement | 9 | 0.50 | 2004 |
Heuristic Search Algorithms Based on Symbolic Data Structures | 10 | 0.54 | 2003 |
Pattern-matching algorithms based on term rewrite systems | 0 | 0.34 | 2000 |
Code Generation Based on Formal BURS Therory and Heuristic Search | 14 | 0.90 | 1997 |
Code Generation = A* + BURS | 4 | 0.53 | 1996 |
Backtracking non-deterministic recognizers | 0 | 0.34 | 1995 |
A grammatical specification of human-computer dialogue | 1 | 0.37 | 1995 |