4370 search results - page 160 / 874 » Algebra of Logic Programming |
92
Voted
ICALP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
105
click to vote
VMCAI
2012
Springer
13 years 8 months ago
2012
Springer
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
95
Voted
DIAGRAMS
2006
Springer
15 years 4 months ago
2006
Springer
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
106
Voted
ESWS
2008
Springer
15 years 2 months ago
2008
Springer
A lot of work has been done in the area of data stream processing. Most of the previous approaches regard only relational or XML based streams but do not cover semantically richer ...
FMICS
2008
Springer
15 years 1 months ago
2008
Springer
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...