Sciweavers

1073 search results - page 4 / 215
» Formal Program Development with Approximations
Sort
View
FMCAD
2006
Springer
13 years 11 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
IFIP
2007
Springer
14 years 1 months ago
In-Time Role-Specific Notification as Formal Means to Balance Agile Practices in Global Software Development Settings
In global software development (GSD) projects, distributed teams collaborate to deliver high-quality software. Project managers need to control these development projects, which in...
Dindin Wahyudin, Matthias Heindl, Benedikt Eckhard...
ECRA
2002
129views more  ECRA 2002»
13 years 7 months ago
A formal approach to negotiating agents development
This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communi...
Marlon Dumas, Guido Governatori, Arthur H. M. ter ...
ECEASST
2006
72views more  ECEASST 2006»
13 years 7 months ago
ENFORCe: A System for Ensuring Formal Correctness of High-level Programs
Graph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a pre- and a postcondition can be show...
Karl Azab, Annegret Habel, Karl-Heinz Pennemann, C...
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
14 years 28 days ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...