147 search results - page 27 / 30 » Unfolding semantics of graph transformation |
87
Voted
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
155
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
94
Voted
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
SAFECOMP
2007
Springer
15 years 3 months ago
2007
Springer
With the rapid progress in science and technology, we find ubiquitous use of safety-critical systems in avionics, consumer electronics, and medical instruments. In such systems, u...