364 search results - page 59 / 73 » Model checking with Boolean Satisfiability |
TOOLS
1999
IEEE
14 years 1 months ago
1999
IEEE
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
AOSD
2009
ACM
13 years 11 months ago
2009
ACM
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
TRUSTBUS
2007
Springer
14 years 2 months ago
2007
Springer
While logging events is becoming increasingly common in computing, in communication and in collaborative environments, log systems need to satisfy increasingly challenging (if not ...
LICS
2005
IEEE
14 years 2 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...