↓ Skip to main content

TAPSOFT '97: Theory and Practice of Software Development

Overview of attention for book
Cover of 'TAPSOFT '97: Theory and Practice of Software Development'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Theoretical Computer Science and software science: The past, the present and the future (position paper)
  3. Altmetric Badge
    Chapter 2 Future trends of TAPSOFT
  4. Altmetric Badge
    Chapter 3 New challenges for theoretical computer science
  5. Altmetric Badge
    Chapter 4 What does the future hold for theoretical computer science?
  6. Altmetric Badge
    Chapter 5 Automata theory on trees and partial orders
  7. Altmetric Badge
    Chapter 6 A theory of testing for timed automata
  8. Altmetric Badge
    Chapter 7 Conservative extensions, interpretations between theories and all that!
  9. Altmetric Badge
    Chapter 8 Specification and proof in membership equational logic
  10. Altmetric Badge
    Chapter 9 Formalism and method
  11. Altmetric Badge
    Chapter 10 CoFI: The common framework initiative for algebraic specification and development
  12. Altmetric Badge
    Chapter 11 Logicality of conditional rewrite systems
  13. Altmetric Badge
    Chapter 12 Simulating forward-branching systems with constructor systems
  14. Altmetric Badge
    Chapter 13 Reliable generalized and context dependent commutation relations
  15. Altmetric Badge
    Chapter 14 Word-into-Trees Transducers with bounded difference
  16. Altmetric Badge
    Chapter 15 Generalized quantitative temporal reasoning: An automata-theoretic approach
  17. Altmetric Badge
    Chapter 16 The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages
  18. Altmetric Badge
    Chapter 17 Model checking through symbolic reachability graph
  19. Altmetric Badge
    Chapter 18 Optimal implementation of wait-free binary relations
  20. Altmetric Badge
    Chapter 19 Relative undecidability in the termination hierarchy of single rewrite rules
  21. Altmetric Badge
    Chapter 20 Termination proofs using gpo ordering constraints
  22. Altmetric Badge
    Chapter 21 Automatically proving termination where simplification orderings fail
  23. Altmetric Badge
    Chapter 22 Generating efficient, terminating logic programs
  24. Altmetric Badge
    Chapter 23 Modal characterization of weak bisimulation for higher-order processes
  25. Altmetric Badge
    Chapter 24 TAPSOFT '97: Theory and Practice of Software Development
  26. Altmetric Badge
    Chapter 25 A uniform syntactical method for proving coinduction principles in λ-calculi
  27. Altmetric Badge
    Chapter 26 A labelled transition system for πε-calculus
  28. Altmetric Badge
    Chapter 27 Set operations for recurrent term schematizations
  29. Altmetric Badge
    Chapter 28 Inclusion constraints over non-empty sets of trees
  30. Altmetric Badge
    Chapter 29 Grid structures and undecidable constraint theories
  31. Altmetric Badge
    Chapter 30 Predicative functional recurrence and poly-space
  32. Altmetric Badge
    Chapter 31 On the complexity of function pointer may-alias analysis
  33. Altmetric Badge
    Chapter 32 Maximum packing for biconnected outerplanar graphs
  34. Altmetric Badge
    Chapter 33 Synchronization of a line of identical processors at a given time
  35. Altmetric Badge
    Chapter 34 An algorithm for the solution of tree equations
  36. Altmetric Badge
    Chapter 35 E-unification by means of tree tuple synchronized grammars
  37. Altmetric Badge
    Chapter 36 Linear interpolation for the higher-order matching problem
  38. Altmetric Badge
    Chapter 37 A semantic framework for functional logic programming with algebraic polymorphic types
  39. Altmetric Badge
    Chapter 38 Subtyping constraints for incomplete objects
  40. Altmetric Badge
    Chapter 39 Partializing stone spaces using SFP domains
  41. Altmetric Badge
    Chapter 40 Let-polymorphism and eager type schemes
  42. Altmetric Badge
    Chapter 41 Semantics of architectural connectors
  43. Altmetric Badge
    Chapter 42 Protective interface specifications
  44. Altmetric Badge
    Chapter 43 Specifying complex and structured systems with Evolving Algebras
  45. Altmetric Badge
    Chapter 44 A comparison of modular verification techniques
  46. Altmetric Badge
    Chapter 45 A compositional proof of a real-time mutual exclusion protocol
  47. Altmetric Badge
    Chapter 46 Traces of I/O-automata in Isabelle/HOLCF
  48. Altmetric Badge
    Chapter 47 Reactive types
  49. Altmetric Badge
    Chapter 48 A type-based approach to program security
  50. Altmetric Badge
    Chapter 49 An applicative module calculus
  51. Altmetric Badge
    Chapter 50 Compositional specification of embedded systems with Statecharts
  52. Altmetric Badge
    Chapter 51 Verification of message sequence charts via template matching
  53. Altmetric Badge
    Chapter 52 Probabilistic lossy channel systems
  54. Altmetric Badge
    Chapter 53 A logic of object-oriented programs
  55. Altmetric Badge
    Chapter 54 Auxiliary variables and recursive procedures
  56. Altmetric Badge
    Chapter 55 Locality based Linda: Programming with explicit localities
  57. Altmetric Badge
    Chapter 56 A syntactic theory of dynamic binding
  58. Altmetric Badge
    Chapter 57 A unified framework for binding-time analysis
  59. Altmetric Badge
    Chapter 58 A typed intermediate language for flow-directed compilation
  60. Altmetric Badge
    Chapter 59 Action refinement as an implementation relation
  61. Altmetric Badge
    Chapter 60 Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs
  62. Altmetric Badge
    Chapter 61 COMPASS: A comprehensible assertion method
  63. Altmetric Badge
    Chapter 62 Using LOTOS patterns to characterize architectural styles
  64. Altmetric Badge
    Chapter 63 Automating formal specification-based testing
  65. Altmetric Badge
    Chapter 64 TYPELAB: An environment for modular program development
  66. Altmetric Badge
    Chapter 65 TAS and IsaWin: Generic interfaces for transformational program development and theorem proving
  67. Altmetric Badge
    Chapter 66 Proving system correctness with KIV
  68. Altmetric Badge
    Chapter 67 A new proof-manager and graphic interface for the Larch Prover
  69. Altmetric Badge
    Chapter 68 A web-based animator for object specifications in a persistent environment
  70. Altmetric Badge
    Chapter 69 Publishing formal specifications in Z notation on world wide web
  71. Altmetric Badge
    Chapter 70 DOSFOP — A documentation tool for the algebraic programming language Opal
  72. Altmetric Badge
    Chapter 71 AG: A set of maple packages for symbolic computing of automata and semigroups
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

patent
3 patents
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
17 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
TAPSOFT '97: Theory and Practice of Software Development
Published by
Springer Science & Business Media, April 1997
DOI 10.1007/bfb0030581
ISBNs
978-3-54-062781-4, 978-3-54-068517-3
Editors

Michel Bidoit, Max Dauchet

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Italy 1 6%
Switzerland 1 6%
Unknown 15 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 35%
Student > Bachelor 2 12%
Researcher 2 12%
Student > Master 2 12%
Lecturer 1 6%
Other 4 24%
Readers by discipline Count As %
Computer Science 14 82%
Business, Management and Accounting 1 6%
Decision Sciences 1 6%
Engineering 1 6%