Sciweavers

238 search results - page 14 / 48
» Compositional Proof Methods for Concurrency: A Semantic Appr...
Sort
View
IANDC
2008
131views more  IANDC 2008»
14 years 9 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
IPPS
1999
IEEE
15 years 1 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
ASM
2008
ASM
14 years 11 months ago
On the Purpose of Event-B Proof Obligations
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges o...
Stefan Hallerstede
ACL
2009
14 years 7 months ago
Learning a Compositional Semantic Parser using an Existing Syntactic Parser
We present a new approach to learning a semantic parser (a system that maps natural language sentences into logical form). Unlike previous methods, it exploits an existing syntact...
Ruifang Ge, Raymond J. Mooney
67
Voted
APAL
2008
80views more  APAL 2008»
14 years 9 months ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari