Sciweavers

177 search results - page 19 / 36
» Logical complexity of graphs: a survey
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
ICALP
2004
Springer
14 years 1 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
GG
2010
Springer
13 years 8 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
GD
2008
Springer
13 years 8 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 7 days ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor