Sciweavers

2236 search results - page 357 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 8 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...
SPE
2002
141views more  SPE 2002»
15 years 3 months ago
Data collection and restoration for heterogeneous process migration
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
Kasidit Chanchio, Xian-He Sun
SIGSOFT
2003
ACM
15 years 9 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 4 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
IPL
2008
102views more  IPL 2008»
15 years 4 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones