Sciweavers

552 search results - page 65 / 111
» Languages Modulo Normalization
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 2 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ICECCS
1999
IEEE
140views Hardware» more  ICECCS 1999»
14 years 1 months ago
Practical Considerations in Protocol Verification: The E-2C Case Study
We report on our efforts to formally specify and verify a new protocol of the E-2C Hawkeye Early Warning Aircraft. The protocol, which is currently in test at Northrop Grumman, su...
Yifei Dong, Scott A. Smolka, Eugene W. Stark, Step...
SIGMOD
1998
ACM
180views Database» more  SIGMOD 1998»
14 years 1 months ago
Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
William W. Cohen
TAPSOFT
1997
Springer
14 years 1 months ago
An Applicative Module Calculus
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
Judicaël Courant
FTRTFT
2000
Springer
14 years 1 months ago
Modeling Faults of Distributed, Reactive Systems
Formal methods can improve the development of systems with high quality requirements, since they usually o er a precise, nonambiguous speci cation language and allow rigorous veri ...
Max Breitling