199 search results - page 17 / 40 » A Fully Abstract Model for Graph-Interpreted Temporal Logic |
124
Voted
FUIN
2007
15 years 1 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
128
Voted
CADE
2002
Springer
16 years 2 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
125
click to vote
TACAS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
121
Voted
POLICY
2007
Springer
15 years 8 months ago
2007
Springer
—There is increasing demand for running interacting applications in a secure and controllable way on mobile devices. Such demand is not fully supported by the Java/.NET security ...
114
click to vote
ICLP
1995
Springer
15 years 5 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...