Sciweavers

64 search results - page 12 / 13
» Real-Counter Automata and Their Decision Problems
Sort
View
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
14 years 8 months ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
CPAIOR
2007
Springer
15 years 3 months ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...
CAV
2003
Springer
107views Hardware» more  CAV 2003»
15 years 2 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
FSTTCS
2004
Springer
15 years 3 months ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
CONCUR
2011
Springer
13 years 9 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon