Some progress in satisfiability checking for difference logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3253, Issue , 2004, Pages 263-276

  Cotton, Scott ^a   Asarin, Eugene ^b   Maler, Oded ^a   Niebert, Peter ^c  

^a VERMAG   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

REAL TIME SYSTEMS; TIME SHARING SYSTEMS;

CONFLICT ANALYSIS; INCREMENTAL ANALYSIS; PERFORMANCE GAIN; PROPOSITIONAL LOGIC; SAT SOLVERS; SATISFIABILITY CHECKING; TIMING CONSTRAINTS;

FORMAL LOGIC;

EID: 26444563886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_19     Document Type: Article

References (31)

1. [ABZ88] J. Adams, E. Balas and D. Zawack, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science 34, 391-401, 1988.
2. [ ACG99] A. Armando, C. Castellini and E. Giunchiglia, SAT-based Procedures for Temporal Reasoning, Proc. ECP'99, LNCS, Springer, 1999.
3. [ABK+97] E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse, Data Structures for the Verification of Timed Automata, Proc. Hybrid and Real-Time Systems, 346-360, LNCS 1201, Springer, 1997.
4. [ABC+02] G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowics and R. Sebastiani, A SATBased Approach for Solving Formulas over Boolean and Linear Mathematical Propositions, in Proc. CADE'02,193-208, LNCS 2392, Springer, 2002.
5. [ACKS02] G. Audemard, A. Cimatti, A. Komilowics and R. Sebastiani, Bounded Model Checking for Timed Systems, Technical report ITC-0201-05, IRST, Trento, 2002.
6. [BDS+02] C. W. Barrett, D. L. Dill, A. Stump, Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT, in Proc CAV'02, 236-249.
7. [BBM04] R. Ben Salah, M. Bozga and O. Maler, On Timing Analysis of Combinational Circuits, Proc. FORMATS'03, 2004.
8. [BS94] J.A. Brzozowski and C-J.H. Seger, Asynchronous Circuits, Springer, 1994.
9. [CLRS01] T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, McGraw-Hill, 2001.
10. [F02] Martin Fränzle, Take It NP-Easy: Bounded Model Construction for Duration Calculus Proc. FTRTFT'02, of 226-243, LNCS 2469, Springer-Verlag, 2002.
11. [FORS01] J-C. Filliâtre, S. Owre, H. Rueß and N. Shankar, ICS: Integrated Canonizer and Solver, Proc. CAV'01, 246-250, 2001.
12. [GN02] E. Goldberg and Y. Novikov: BerkMin, a Fast and Robust SAT-solver, Proc. DATE '02, 142-149, 2002.
13. [GR93] A. V. Goldberg and T. Radzik, A Heuristic Improvement of the Bellman-Ford Algorithm, In Applied Mathematics Letters 6, 1993.
14. [H00] J. Hooker, Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley, 2000
15. [JM94] J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey, Journal of Logic Programming, 19/20, 503-581, 1994.
16. [JM99] A.S. Jain and S. Meeran, Deterministic Job-Shop Scheduling: Past, Present and Future, European Journal of Operational Research 113, 390-434, 1999.
17. [M03] M. Mahfoudh, On Satisfaiblity Checking for Difference Logic, PhD Thesis, Univeristé Joseph Fourier, Grenoble, 2003.
18. [MNAM02] M. Mahfoudh, P. Niebert, E. Asarin and O. Maler, A Satisfiability Checker for Difference Logic, Proc. SAT'2002, 2002.
19. [MP95] O. Maler and A. Pnueli, Timing Analysis of Asynchronous Circuits using Timed Automata, Proc. CHARME'95, 189-205, LNCS 987, Springer, 1995.
20. [MS99] J.P. Marques-Silva and K.A. Sakallah, GRASP: A Search Algorithm for Prepositional Satisfiability, IEEE Transactions on Computers 48, 506-21, 1999.
21. [MMZ+01] M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an Efficient SAT Solver, Proc. DAC 2001, 2001.
22. [MRS02] L. de Moura, H. Rueß and M. Sorea, Lazy Theorem Proving for Bounded Model Checking over Infinite Domains, Proc. CADE'02, 437-453, LNCS 2392, Springer, 2002.
23. [NMA+02] P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, N. Jain and O. Maler, Verification of Timed Automata via Satisfiability Checking, Proc. FTRTFT'02, 225-244, LNCS 2469, Springer, 2002.
24. [S02] M. Sorea, Bounded Model Checking for Timed Automata, Proc. MTCS'02, 2002.
25. [SSB02] O. Strichman, S.A. Seshia, and R.E. Bryant, Deciding Separation Formulas with SAT, in Proc. CAV'2002, Springer, 2002.
26. [Tar72] R. Tarjan. Depth-first Search and Linear Graph Algorithms. SIAM J. Comput. 1, 146-160, 1972.
27. [T70] G. Tseitin, On the Complexity of Derivation in Propositional Calculus, in Studies in Constructive Mathematics and Mathematical Logic 2, 115-125, Consultants Bureau, New York, 1970.
28. [W90] J.M. Wilson, Compact normal forms in prepositional logic and integer programming formulations, Computers and Operation Research, 309-314, 1990.
29. [WZP03] B. Wozna, A. Zbrzezny and W. Penczek, Checking Reachability Properties for Timed Automata via SAT, Fundamenta Infonnaticae 55, 223-241, 2003.
30. [Zha95] G. Zhang. The Davis-Putnam Resolution Procedure, In Advances in Logic Programming and Automated Reasoning, volume 2. Ablex Publishing Corporation, 1995.
31. [ZH96] H. Zhang and M. Stickel: An Efficient Algorithm for Unit Propogation, In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics. 1996.