Sciweavers

43 search results - page 3 / 9
» Experience-driven procedural content generation (Extended ab...
Sort
View
ICWS
2004
IEEE
13 years 7 months ago
Realizability of Conversation Protocols With Message Contents
A conversation protocol is a top-down specification framework which specifies desired global behaviors of a web service composition. In our earlier work [6] we studied the problem...
Xiang Fu, Tevfik Bultan, Jianwen Su
FORTE
2003
13 years 7 months ago
Generation of All Counter-Examples for Push-Down Systems
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...
Samik Basu, Diptikalyan Saha, Yow-Jian Lin, Scott ...
JAPLL
2007
113views more  JAPLL 2007»
13 years 5 months ago
Fresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...
Murdoch Gabbay
FSTTCS
2006
Springer
13 years 9 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
FTP
1998
Springer
13 years 9 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt