154 search results - page 26 / 31 » Proof Complexity of Non-classical Logics |
ISCAS
2003
IEEE
14 years 21 days ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
LICS
2003
IEEE
14 years 21 days ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
SRDS
1999
IEEE
13 years 11 months ago
1999
IEEE
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
CCS
2003
ACM
14 years 19 days ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...