Sciweavers

458 search results - page 37 / 92
» An Algebraic Approach to Sharing Analysis of Logic Programs
Sort
View
PPDP
2007
Springer
14 years 2 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
SAC
2010
ACM
14 years 3 months ago
Dual analysis for proving safety and finding bugs
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
Corneliu Popeea, Wei-Ngan Chin
POPL
2005
ACM
14 years 9 months ago
Permission accounting in separation logic
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
Richard Bornat, Cristiano Calcagno, Peter W. O'Hea...
POPL
2004
ACM
14 years 9 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
CAISE
2008
Springer
13 years 10 months ago
Formal Modeling and Discrete-Time Analysis of BPEL Web Services
Abstract. Web services are increasingly used for building enterprise information systems according to the Service Oriented Architecture (Soa) paradigm. We propose in this paper a t...
Radu Mateescu, Sylvain Rampacek