535 search results - page 31 / 107 » Checking Computations in Polylogarithmic Time |
FASE
2010
Springer
13 years 11 months ago
2010
Springer
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
IEEEHPCS
2010
13 years 6 months ago
2010
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
VLSID
2008
IEEE
14 years 8 months ago
2008
IEEE
Protocol conversion involves the use of a converter to control communication between two or more protocols such that desired system-level specifications can be satisfied. We invest...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...