4573 search results - page 692 / 915 » Automated Reasoning |
155
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
119
click to vote
LICS
2005
IEEE
15 years 9 months 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...
124
Voted
LICS
2005
IEEE
15 years 9 months 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 ...
146
Voted
LICS
2005
IEEE
15 years 9 months 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...
146
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...