1497 search results - page 228 / 300 » Extended static checking |
91
Voted
IJCAI
1997
15 years 2 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
101
Voted
SLP
1993
15 years 2 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
74
Voted
USENIX
1994
15 years 2 months ago
1994
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
108
click to vote
SAC
2010
ACM
15 years 27 days ago
2010
ACM
Service-based systems can be modeled as stand-alone services coordinated by external connectors. Reo is a channelbased coordination language with well-defined semantics that enabl...
95
Voted
AAMAS
2007
Springer
15 years 25 days ago
2007
Springer
Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of pro...