Sciweavers

1174 search results - page 58 / 235
» A Logical Approach to Abstract Algebra
Sort
View
DAC
2003
ACM
14 years 11 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
EACL
1989
ACL Anthology
13 years 11 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 9 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
CSL
2007
Springer
14 years 4 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
ICIW
2007
IEEE
14 years 4 months ago
Web Service Composition Approaches: From Industrial Standards to Formal Methods
Abstract— Composition of web services is much studied to support business-to-business and enterprise application integration in e-Commerce. Current web service composition approa...
Maurice H. ter Beek, Antonio Bucchiarone, Stefania...