499 search results - page 68 / 100 » LTL satisfiability checking |
CJ
2004
14 years 11 months ago
2004
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
DAC
2009
ACM
16 years 25 days ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
208
click to vote
POPL
2006
ACM
16 years 4 days ago
2006
ACM
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
104
click to vote
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...