TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540627814, 9783540685173

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Formats of ordered SOS rules with silent actions

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030605 ◽

1997 ◽

pp. 297-308 ◽

Cited By ~ 4

Author(s):

Irek Ulidowski ◽

Iain Phillips

Download Full-text

Word-into-Trees Transducers with bounded difference

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030595 ◽

1997 ◽

pp. 177-188 ◽

Cited By ~ 1

Author(s):

Yves Andre ◽

Francis Bossut

Download Full-text

CoFI: The common framework initiative for algebraic specification and development

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030591 ◽

1997 ◽

pp. 115-137 ◽

Cited By ~ 37

Author(s):

Peter D. Mosses

Keyword(s):

Algebraic Specification ◽

Common Framework ◽

The Common

Download Full-text

A labelled transition system for πε-calculus

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030607 ◽

1997 ◽

pp. 321-332 ◽

Cited By ~ 1

Author(s):

Franck van Breugel

Keyword(s):

Transition System ◽

Labelled Transition System

Download Full-text

Optimal implementation of wait-free binary relations

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030599 ◽

1997 ◽

pp. 225-236

Author(s):

Eric Goubault

Keyword(s):

Binary Relations ◽

Optimal Implementation

Download Full-text

A typed intermediate language for flow-directed compilation

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030639 ◽

1997 ◽

pp. 757-771 ◽

Cited By ~ 8

Author(s):

J. B. Wells ◽

Allyn Dimock ◽

Robert Muller ◽

Franklyn Turbak

Keyword(s):

Intermediate Language

Download Full-text

Action refinement as an implementation relation

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030640 ◽

1997 ◽

pp. 772-786 ◽

Cited By ~ 12

Author(s):

Arend Rensink ◽

Roberto Gorrieri

Keyword(s):

Action Refinement ◽

Implementation Relation

Download Full-text

Automata theory on trees and partial orders

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030586 ◽

1997 ◽

pp. 20-38 ◽

Cited By ~ 12

Author(s):

Wolfgang Thomas

Keyword(s):

Partial Orders ◽

Automata Theory

Download Full-text

A semantic framework for functional logic programming with algebraic polymorphic types

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030618 ◽

1997 ◽

pp. 453-464 ◽

Cited By ~ 9

Author(s):

P. Arenas-Sánchez ◽

M. Rodríguez-Artalejo

Keyword(s):

Logic Programming ◽

Semantic Framework ◽

Functional Logic Programming ◽

Functional Logic

Download Full-text

The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science ◽

10.1007/bfb0030597 ◽

1997 ◽

pp. 201-212 ◽

Cited By ~ 3

Author(s):

Danièle Beauquier ◽

Anatol Slissenko

Keyword(s):

Model Checking ◽

High Level

Download Full-text

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Formats of ordered SOS rules with silent actions

Word-into-Trees Transducers with bounded difference

CoFI: The common framework initiative for algebraic specification and development

A labelled transition system for πε-calculus

Optimal implementation of wait-free binary relations

A typed intermediate language for flow-directed compilation

Action refinement as an implementation relation

Automata theory on trees and partial orders

A semantic framework for functional logic programming with algebraic polymorphic types

The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages

TAPSOFT '97: Theory and Practice of Software Development - Lecture Notes in Computer Science
Latest Publications