Sciweavers

1073 search results - page 69 / 215
» Formal Program Development with Approximations
Sort
View
CADE
2007
Springer
14 years 9 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
DISOPT
2008
138views more  DISOPT 2008»
13 years 8 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
JOT
2010
144views more  JOT 2010»
13 years 7 months ago
A Tool for Specifying and Validating Agents' Interaction Protocols: From Agent UML to Maude
To achieve the multi-agent systems’ goals, agents interact to exchange information, to cooperate and to coordinate their tasks. Interaction is generally recognized as an importa...
Farid Mokhati, Brahim Sahraoui, Soufiane Bouzaher,...
ENTCS
2006
160views more  ENTCS 2006»
13 years 8 months ago
Checking and Correcting Behaviors of Java Programs at Runtime with Java-MOP
Monitoring-oriented programming (MOP) is a software development and analysis technique in which monitoring plays a fundamental role. MOP users can add their favorite or domain-spe...
Feng Chen, Marcelo d'Amorim, Grigore Rosu
SEFM
2007
IEEE
14 years 3 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook