1743 search results - page 110 / 349 » Generalized Modal Satisfiability |
112
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
165
Voted
POPL
2007
ACM
16 years 1 months ago
2007
ACM
Future software development will rely on product synthesis, i.e., the synthesis of code and non-code artifacts for a target component or application. Prior work on feature-based p...
108
Voted
FCT
2003
Springer
15 years 6 months ago
2003
Springer
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
105
Voted
ICLP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
96
Voted
EMSOFT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Embedded systems for safety-critical applications often integrate multiple “functions” and must generally be fault-tolerant. These requirements lead to a need for mec...