Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540418641, 9783540453154

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Secrecy Types for Asymmetric Communication

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_2 ◽

2001 ◽

pp. 25-41 ◽

Cited By ~ 22

Author(s):

Martín Abadi ◽

Bruno Blanchet

Keyword(s):

Asymmetric Communication

Download Full-text

Type Inference with Recursive Type Equations

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_12 ◽

2001 ◽

pp. 184-198 ◽

Cited By ~ 5

Author(s):

Mario Coppo

Keyword(s):

Type Inference

Download Full-text

The Finite Graph Problem for Two-Way Alternating Automata

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_6 ◽

2001 ◽

pp. 88-103 ◽

Cited By ~ 1

Author(s):

Mikolaj Bojańczyk

Keyword(s):

Finite Graph ◽

Graph Problem ◽

Alternating Automata

Download Full-text

Class Analysis of Object-Oriented Programs through Abstract Interpretation

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_17 ◽

2001 ◽

pp. 261-275 ◽

Cited By ~ 7

Author(s):

Thomas Jensen ◽

Fausto Spoto

Keyword(s):

Abstract Interpretation ◽

Object Oriented ◽

Class Analysis

Download Full-text

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_24 ◽

2001 ◽

pp. 364-378 ◽

Cited By ~ 9

Author(s):

Christine Röckl ◽

Daniel Hirschkoff ◽

Stefan Berghofer

Keyword(s):

Higher Order ◽

Abstract Syntax ◽

Π Calculus

Download Full-text

Foundations for a Graph-Based Approach to the Specification of Access Control Policies

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_19 ◽

2001 ◽

pp. 287-302 ◽

Cited By ~ 10

Author(s):

Manuel Koch ◽

Luigi Vincenzo Mancini ◽

Francesco Parisi-Presicce

Keyword(s):

Access Control ◽

Control Policies ◽

Access Control Policies

Download Full-text

On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_22 ◽

2001 ◽

pp. 332-346 ◽

Cited By ~ 10

Author(s):

Rémi Morin

Keyword(s):

Trace Theory ◽

Message Sequence Chart

Download Full-text

Temporary Data in Shared Dataspace Coordination Languages

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_8 ◽

2001 ◽

pp. 121-136 ◽

Cited By ~ 7

Author(s):

Nadia Busi ◽

Roberto Gorrieri ◽

Gianluigi Zavattaro

Keyword(s):

Coordination Languages

Download Full-text

On Garbage and Program Logic

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_9 ◽

2001 ◽

pp. 137-151 ◽

Cited By ~ 4

Author(s):

Cristiano Calcagno ◽

Peter W. O’Hearn

Keyword(s):

Program Logic

Download Full-text

On the Duality between Observability and Reachability

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-45315-6_5 ◽

2001 ◽

pp. 72-87 ◽

Cited By ~ 4

Author(s):

Michel Bidoit ◽

Rolf Hennicker ◽

Alexander Kurz

Download Full-text

Lecture Notes in Computer Science - Foundations of Software Science and Computation StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Secrecy Types for Asymmetric Communication

Type Inference with Recursive Type Equations

The Finite Graph Problem for Two-Way Alternating Automata

Class Analysis of Object-Oriented Programs through Abstract Interpretation

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts

Foundations for a Graph-Based Approach to the Specification of Access Control Policies

On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory

Temporary Data in Shared Dataspace Coordination Languages

On Garbage and Program Logic

On the Duality between Observability and Reachability

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures
Latest Publications