11345 search results - page 1688 / 2269 » Foundations of Computer Science |
163
Voted
LICS
2005
IEEE
16 years 7 hour ago
2005
IEEE
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
162
click to vote
LICS
2005
IEEE
16 years 7 hour ago
2005
IEEE
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
181
click to vote
LICS
2005
IEEE
16 years 7 hour ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
148
click to vote
LICS
2005
IEEE
16 years 7 hour ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
155
Voted
LICS
2005
IEEE
16 years 7 hour ago
2005
IEEE
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...