Sciweavers

200 search results - page 35 / 40
» Logic Programs under Three-Valued Lukasiewicz Semantics
Sort
View
FCT
2007
Springer
14 years 3 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
LICS
2002
IEEE
14 years 2 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
ICLP
1990
Springer
14 years 1 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
IEE
2008
115views more  IEE 2008»
13 years 9 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
CACM
1999
92views more  CACM 1999»
13 years 9 months ago
Putting OO Distributed Programming to Work
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
Pascal Felber, Rachid Guerraoui, Mohamed Fayad