Sciweavers

977 search results - page 166 / 196
» Logic programming with infinite sets
Sort
View
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
PDP
2005
IEEE
14 years 1 months ago
Distributed Local Resolution of Boolean Equation Systems
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...
Christophe Joubert, Radu Mateescu
FASE
2005
Springer
14 years 28 days ago
Improving the Build Architecture of Legacy C/C++ Software Systems
Abstract. The build architecture of legacy C/C++ software systems, groups program files in directories to represent logical components. The interfaces of these components are loos...
Homayoun Dayani-Fard, Yijun Yu, John Mylopoulos, P...
SAC
2000
ACM
13 years 11 months ago
A Coordination Language for Collective Agent Based Systems: GroupLog
We describe a language providing concepts for modeling autonomous entities (agents) and cooperating entities (groups). Agents are the execution units of a GroupLog program. Each a...
Fernanda Barbosa, José C. Cunha
HASE
2007
IEEE
13 years 11 months ago
Multiple Pre/Post Specifications for Heap-Manipulating Methods
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...