Sciweavers

2432 search results - page 89 / 487
» Cryptographic logical relations
Sort
View
DLT
2009
14 years 8 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin
POPL
2008
ACM
15 years 10 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
87
Voted
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
15 years 4 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
87
Voted
SARA
2009
Springer
15 years 4 months ago
Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases
Real-world automated reasoning systems must contend with inconsistencies and the vast amount of information stored in relational databases. In this paper, we introduce compilation...
Timothy L. Hinrichs, Jui-Yi Kao, Michael R. Genese...
EACL
1989
ACL Anthology
14 years 11 months ago
Programming in Logic with Constraints for Natural Language Processing
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
Patrick Saint-Dizier