Sciweavers

1799 search results - page 46 / 360
» The Logic of Correctness in Software Engineering
Sort
View
ATAL
2009
Springer
15 years 10 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
PLDI
2009
ACM
16 years 19 days ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner
CBSE
2004
Springer
15 years 11 months ago
Correct Components Assembly for a Product Data Management Cooperative System
In this paper we report on a case study of correct automatic assembly of software components. We show the application of our tool (called Synthesis) for correct components assembly...
Massimo Tivoli, Paola Inverardi, Valentina Presutt...
SIGSOFT
2003
ACM
16 years 6 months ago
Policy-enforced linking of untrusted components
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
Eunyoung Lee, Andrew W. Appel
FOSSACS
2004
Springer
15 years 11 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil