Sciweavers

799 search results - page 73 / 160
» A Logic for Abstract State Machines
Sort
View
DBPL
2007
Springer
102views Database» more  DBPL 2007»
15 years 11 months ago
A Theory of Stream Queries
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
CADE
2008
Springer
16 years 5 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ICPR
2010
IEEE
15 years 2 months ago
Speech Emotion Classification and Public Speaking Skill Assessment
Abstract. This paper presents a new classification algorithm for realtime inference of emotions from the non-verbal features of speech. It identifies simultaneously occurring emoti...
Tomas Pfister, Peter Robinson
POPL
2009
ACM
16 years 5 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
129
Voted
ICLP
1992
Springer
15 years 8 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen