Sciweavers

579 search results - page 98 / 116
» Combined reasoning by automated cooperation
Sort
View
ASM
2008
ASM
13 years 9 months ago
A First Attempt to Express KAOS Refinement Patterns with Event B
anguage (Event B), hence staying at the same abstraction level. Thus we take advantage from the Event B method: (i) it is possible to use the method during the whole development pr...
Abderrahman Matoussi, Frédéric Gerva...
ECLIPSE
2005
ACM
13 years 9 months ago
Bridging the gap between technical and social dependencies with Ariadne
One of the reasons why large-scale software development is difficult is the number of dependencies that software engineers need to face: e.g., dependencies among the software comp...
Erik Trainer, Stephen Quirk, Cleidson R. B. de Sou...
CSCW
2004
ACM
14 years 29 days ago
High-performance telepointers
Although telepointers are valuable for supporting real-time collaboration, they are rarely seen in commercial groupware applications that run on the Internet. One reason for their...
Jeff Dyck, Carl Gutwin, Sriram Subramanian, Chris ...
CADE
2007
Springer
14 years 7 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard