Sciweavers

5243 search results - page 1011 / 1049
» Reasoning About Strategies
Sort
View
LATA
2010
Springer
14 years 1 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
OOIS
1994
Springer
14 years 1 months ago
Problems, Descriptions and Objects
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
Michael Jackson
POPL
1989
ACM
14 years 1 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
AGTIVE
2007
Springer
14 years 1 months ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
CGO
2009
IEEE
14 years 1 months ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky
« Prev « First page 1011 / 1049 Last » Next »