Sciweavers

1376 search results - page 174 / 276
» Model-Driven Software Verification
Sort
View
DAC
2009
ACM
16 years 4 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
ESAW
2004
Springer
15 years 8 months ago
Managing Conflicts Between Individuals and Societies in Multi-agent Systems
The development of multi-agent systems (MAS) implies considering both the social and individual levels of these systems. However, the elements in these levels are not necessarily c...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
15 years 7 months ago
Symbolic model checking of institutions
Norms defined by institutions and enforced by organizations have been put forward as a mechanism to increase the efficiency and reliability of electronic transactions carried out ...
Francesco Viganò, Marco Colombetti
HIPC
2007
Springer
15 years 7 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FOAL
2008
ACM
15 years 4 months ago
Certificate translation for specification-preserving advices
Aspect Oriented Programming (AOP) has significant potential to separate functionality and cross-cutting concerns. In particular, AOP supports an incremental development process, i...
Gilles Barthe, César Kunz