Sciweavers

1996 search results - page 72 / 400
» A decision procedure for linear
Sort
View
TIME
2007
IEEE
16 years 16 days ago
Automated Natural Deduction for Propositional Linear-Time Temporal Logic
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
CADE
2009
Springer
16 years 6 months ago
Computing Knowledge in Security Protocols under Convergent Equational Theories
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
Stéphanie Delaune, Stefan Ciobâca, St...
CADE
2001
Springer
16 years 6 months ago
Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
Jörg Lücke
TPHOL
2009
IEEE
16 years 28 days ago
Extended First-Order Logic
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
Chad E. Brown, Gert Smolka
CONCUR
2005
Springer
15 years 11 months ago
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
Sibylle B. Fröschle, Slawomir Lasota