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

9783540657194, 9783540490197

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

String Languages Generated by Total Deterministic Macro Tree Transducers

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

10.1007/3-540-49019-1_18 ◽

1999 ◽

pp. 258-272 ◽

Cited By ~ 2

Author(s):

Sebastian Maneth

Keyword(s):

Tree Transducers

Download Full-text

A Strong Logic Programming View for Static Embedded Implications

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

10.1007/3-540-49019-1_5 ◽

1999 ◽

pp. 56-72 ◽

Cited By ~ 4

Author(s):

R. Arruabarrena ◽

P. Lucio ◽

M. Navarro

Keyword(s):

Logic Programming

Download Full-text

A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees

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

10.1007/3-540-49019-1_13 ◽

1999 ◽

pp. 180-196 ◽

Cited By ~ 6

Author(s):

Evgeny Dantsin ◽

Andrei Voronkov

Keyword(s):

Polynomial Time ◽

Unification Algorithm

Download Full-text

A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects

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

10.1007/3-540-49019-1_17 ◽

1999 ◽

pp. 243-257 ◽

Cited By ~ 1

Author(s):

Marina Lenisa

Keyword(s):

Logical System ◽

Bisimulation Equivalence

Download Full-text

Equational Properties of Mobile Ambients

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

10.1007/3-540-49019-1_15 ◽

1999 ◽

pp. 212-226 ◽

Cited By ~ 14

Author(s):

Andrew D. Gordon ◽

Luca Cardelli

Keyword(s):

Mobile Ambients

Download Full-text

Probabilistic Temporal Logics via the Modal Mu-Calculus

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

10.1007/3-540-49019-1_20 ◽

1999 ◽

pp. 288-305 ◽

Cited By ~ 6

Author(s):

Murali Narasimha ◽

Rance Cleaveland ◽

Purush Iyer

Keyword(s):

Temporal Logics

Download Full-text

An Algebraic Characterization of Typability in ML with Subtyping

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

10.1007/3-540-49019-1_8 ◽

1999 ◽

pp. 104-119

Author(s):

Marcin Benke

Keyword(s):

Algebraic Characterization

Download Full-text

Testing Hennessy-Milner Logic with Recursion

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

10.1007/3-540-49019-1_4 ◽

1999 ◽

pp. 41-55 ◽

Cited By ~ 11

Author(s):

Luca Aceto ◽

Anna Ingólfsdóttir

Download Full-text

A WP-calculus for OO

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

10.1007/3-540-49019-1_10 ◽

1999 ◽

pp. 135-140 ◽

Cited By ~ 26

Author(s):

F. S de Boer

Download Full-text

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis

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

10.1007/3-540-49019-1_2 ◽

1999 ◽

pp. 14-30 ◽

Cited By ~ 47

Author(s):

Javier Esparza ◽

Jens Knoop

Keyword(s):

Data Flow ◽

Flow Analysis ◽

Theoretic Approach ◽

Data Flow Analysis

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

String Languages Generated by Total Deterministic Macro Tree Transducers

A Strong Logic Programming View for Static Embedded Implications

A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees

A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects

Equational Properties of Mobile Ambients

Probabilistic Temporal Logics via the Modal Mu-Calculus

An Algebraic Characterization of Typability in ML with Subtyping

Testing Hennessy-Milner Logic with Recursion

A WP-calculus for OO

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis

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