Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
The formal semantics of programming languages: an introductionFebruary 1993
Publisher:
  • MIT Press
  • 55 Hayward St.
  • Cambridge
  • MA
  • United States
ISBN:978-0-262-23169-5
Published:15 February 1993
Pages:
361
Skip Bibliometrics Section
Reflects downloads up to 12 Sep 2024Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Brucker A, Cameron-Burke T and Stell A Formally Verified Interval Arithmetic and Its Application to Program Verification Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE), (111-121)
  2. Kawamoto Y, Sato T and Suenaga K (2024). Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs, Artificial Intelligence, 326:C, Online publication date: 1-Jan-2024.
  3. ACM
    Murali A, Peña L, Jhala R and Madhusudan P (2023). Complete First-Order Reasoning for Properties of Functional Programs, Proceedings of the ACM on Programming Languages, 7:OOPSLA2, (1063-1092), Online publication date: 16-Oct-2023.
  4. ACM
    Bruni R, Giacobazzi R, Gori R and Ranzato F (2023). A Correctness and Incorrectness Program Logic, Journal of the ACM, 70:2, (1-45), Online publication date: 30-Apr-2023.
  5. Zhang N, Yu C, Duan Z and Tian C (2023). A proof system for unified temporal logic, Theoretical Computer Science, 949:C, Online publication date: 9-Mar-2023.
  6. ACM
    Kim J, D'Antoni L and Reps T (2023). Unrealizability Logic, Proceedings of the ACM on Programming Languages, 7:POPL, (659-688), Online publication date: 9-Jan-2023.
  7. ACM
    Mastorou L, Papaspyrou N and Vazou N Coinduction inductively: mechanizing coinductive proofs in Liquid Haskell Proceedings of the 15th ACM SIGPLAN International Haskell Symposium, (1-12)
  8. ACM
    Matache C, Moss S and Staton S Concrete categories and higher-order recursion Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-14)
  9. Glück R, Kaarsgaard R and Yokoyama T (2022). From reversible programming languages to reversible metalanguages, Theoretical Computer Science, 920:C, (46-63), Online publication date: 12-Jun-2022.
  10. ACM
    Bruni R, Giacobazzi R, Gori R and Ranzato F Abstract interpretation repair Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, (426-441)
  11. ACM
    Edalat A (2021). Smooth Approximation of Lipschitz Maps and Their Subgradients, Journal of the ACM, 69:1, (1-32), Online publication date: 28-Feb-2022.
  12. ACM
    Campion M, Dalla Preda M and Giacobazzi R (2022). Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis, Proceedings of the ACM on Programming Languages, 6:POPL, (1-31), Online publication date: 16-Jan-2022.
  13. ACM
    Renda A, Ding Y and Carbin M Programming with neural surrogates of programs Proceedings of the 2021 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, (18-38)
  14. ACM
    Harrison W, Hathhorn C and Allwein G A Mechanized Semantic Metalanguage for High Level Synthesis Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming, (1-14)
  15. ACM
    Bruni R, Giacobazzi R, Gori R and Ranzato F A logic for locally complete abstract interpretations Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
  16. ACM
    Batz K, Kaminski B, Katoen J and Matheja C (2021). Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning, Proceedings of the ACM on Programming Languages, 5:POPL, (1-30), Online publication date: 4-Jan-2021.
  17. ACM
    Ferdowsifard K, Ordookhanians A, Peleg H, Lerner S and Polikarpova N Small-Step Live Programming by Example Proceedings of the 33rd Annual ACM Symposium on User Interface Software and Technology, (614-626)
  18. ACM
    Amtoft T and Banerjee A (2020). A Theory of Slicing for Imperative Probabilistic Programs, ACM Transactions on Programming Languages and Systems, 42:2, (1-71), Online publication date: 30-Jun-2020.
  19. Jaiswal S, Khedker U and Chakraborty S (2020). Bidirectionality in flow-sensitive demand-driven analysis, Science of Computer Programming, 190:C, Online publication date: 1-May-2020.
  20. ACM
    Bruni R, Giacobazzi R, Gori R, Garcia-Contreras I and Pavlovic D (2019). Abstract extensionality: on the properties of incomplete abstract interpretations, Proceedings of the ACM on Programming Languages, 4:POPL, (1-28), Online publication date: 1-Jan-2020.
  21. Apt K and Olderog E (2019). Fifty years of Hoare’s logic, Formal Aspects of Computing, 31:6, (751-807), Online publication date: 1-Dec-2019.
  22. Duan Z, Tian C, Zhang N, Ma Q and Du H (2019). Index set expressions can represent temporal logic formulas, Theoretical Computer Science, 788:C, (21-38), Online publication date: 8-Oct-2019.
  23. Glück R, Kaarsgaard R and Yokoyama T Reversible Programs Have Reversible Semantics Formal Methods. FM 2019 International Workshops, (413-427)
  24. Glück R and Yokoyama T (2019). Constructing a binary tree from its traversals by reversible recursion and iteration, Information Processing Letters, 147:C, (32-37), Online publication date: 1-Jul-2019.
  25. Jakobsson A (2019). Automatic Cost Analysis for Imperative BSP Programs, International Journal of Parallel Programming, 47:2, (184-212), Online publication date: 1-Apr-2019.
  26. Dimovski A, Brabrand C and Wąsowski A (2019). Finding suitable variability abstractions for lifted analysis, Formal Aspects of Computing, 31:2, (231-259), Online publication date: 1-Apr-2019.
  27. ACM
    Audrito G, Viroli M, Damiani F, Pianini D and Beal J (2019). A Higher-Order Calculus of Computational Fields, ACM Transactions on Computational Logic, 20:1, (1-55), Online publication date: 31-Jan-2019.
  28. ACM
    Kaminski B, Katoen J, Matheja C and Olmedo F (2018). Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms, Journal of the ACM, 65:5, (1-68), Online publication date: 31-Oct-2018.
  29. ACM
    Zhu R, Cassel D, Sabry A and Huang Y NANOPI Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (862-879)
  30. Abbas H, Saha I, Shoukry Y, Ehlers R, Fainekos G, Gupta R, Majumdar R and Ulus D Embedded software for robotics: challenges and future directions Proceedings of the International Conference on Embedded Software, (1-10)
  31. Shi L, Zhao Y, Liu Y, Sun J, Dong J and Qin S (2018). A UTP semantics for communicating processes with shared variables and its formal encoding in PVS, Formal Aspects of Computing, 30:3-4, (351-380), Online publication date: 1-Aug-2018.
  32. Rubio R, Martí-Oliet N, Pita I and Verdejo A Parameterized Strategies Specification in Maude Recent Trends in Algebraic Development Techniques, (27-44)
  33. ACM
    Giacobazzi R and Mastroeni I (2018). Abstract Non-Interference, ACM Transactions on Privacy and Security, 21:2, (1-31), Online publication date: 31-May-2018.
  34. ACM
    Ahmad M and Cheung A Automatically Leveraging MapReduce Frameworks for Data-Intensive Applications Proceedings of the 2018 International Conference on Management of Data, (1205-1220)
  35. Pavlovic D and Yahia M Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract) Coalgebraic Methods in Computer Science, (167-189)
  36. ACM
    Dabrowski F Textual alignment in SPMD programs Proceedings of the 33rd Annual ACM Symposium on Applied Computing, (1046-1053)
  37. ACM
    Imanishi A, Suenaga K and Igarashi A A guess-and-assume approach to loop fusion for program verification Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, (2-14)
  38. Jha S and Seshia S (2017). A theory of formal synthesis via inductive learning, Acta Informatica, 54:7, (693-726), Online publication date: 1-Nov-2017.
  39. Lin S, Sun J, Xiao H, Liu Y, Sanán D and Hansen H FiB: squeezing loop invariants by interpolation between Forward/Backward predicate transformers Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, (793-803)
  40. Hidaka S, Jouault F and Tisi M On additivity in transformation languages Proceedings of the ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems, (23-33)
  41. ACM
    Ferles K, Wüstholz V, Christakis M and Dillig I Failure-directed program trimming Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, (174-185)
  42. Damouche N, Martel M and Chapoutot A (2017). Improving the numerical accuracy of programs by automatic transformation, International Journal on Software Tools for Technology Transfer (STTT), 19:4, (427-448), Online publication date: 1-Aug-2017.
  43. Kaminski B and Katoen J A weakest pre-expectation semantics for mixed-sign expectations Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
  44. ACM
    Amrani M and Schobbens P Formal Analysis of Object-Oriented Mograms Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs, (1-6)
  45. ACM
    Assaf M, Naumann D, Signoles J, Totel É and Tronel F (2017). Hypercollecting semantics and its application to static analysis of information flow, ACM SIGPLAN Notices, 52:1, (874-887), Online publication date: 11-May-2017.
  46. ACM
    Arawjo I, Li D and Ma K Reduct Proceedings of the 2017 CHI Conference Extended Abstracts on Human Factors in Computing Systems, (202-205)
  47. Jing Y, Wang H, Huang Y, Zhang L, Xu J and Cao Y (2017). A modeling language to describe massive data storage management in cyber-physical systems, Journal of Parallel and Distributed Computing, 103:C, (113-120), Online publication date: 1-May-2017.
  48. Then M, Kersten T, Günnemann S, Kemper A and Neumann T (2017). Automatic algorithm transformation for efficient multi-snapshot analytics on temporal graphs, Proceedings of the VLDB Endowment, 10:8, (877-888), Online publication date: 1-Apr-2017.
  49. ACM
    Karbyshev A, Bjørner N, Itzhaky S, Rinetzky N and Shoham S (2017). Property-Directed Inference of Universal Invariants or Proving Their Absence, Journal of the ACM, 64:1, (1-33), Online publication date: 29-Mar-2017.
  50. ACM
    Shi X, Cui B, Dobbie G and Ooi B (2016). UniAD, ACM Transactions on Database Systems, 42:1, (1-42), Online publication date: 2-Mar-2017.
  51. ACM
    Kojima K and Igarashi A (2017). A Hoare Logic for GPU Kernels, ACM Transactions on Computational Logic, 18:1, (1-43), Online publication date: 31-Jan-2017.
  52. ACM
    Assaf M, Naumann D, Signoles J, Totel É and Tronel F Hypercollecting semantics and its application to static analysis of information flow Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (874-887)
  53. Mota A, Iyoda J and Maranhão H (2016). Program synthesis by model finding, Information Processing Letters, 116:11, (701-705), Online publication date: 1-Nov-2016.
  54. Shi Y, Tian C, Duan Z and Zhou M (2016). Model checking Petri nets with MSVL, Information Sciences: an International Journal, 363:C, (274-291), Online publication date: 1-Oct-2016.
  55. ACM
    Kamil S, Cheung A, Itzhaky S and Solar-Lezama A (2016). Verified lifting of stencil computations, ACM SIGPLAN Notices, 51:6, (711-726), Online publication date: 1-Aug-2016.
  56. ACM
    Hino W, Kobayashi H, Hasuo I and Jacobs B Healthiness from Duality Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (682-691)
  57. ACM
    Kamil S, Cheung A, Itzhaky S and Solar-Lezama A Verified lifting of stencil computations Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, (711-726)
  58. Kaminski B, Katoen J, Matheja C and Olmedo F Weakest Precondition Reasoning for Expected Run---Times of Probabilistic Programs Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (364-389)
  59. Huang D and Morrisett G An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (337-363)
  60. ACM
    Mamouras K (2016). The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes, ACM Transactions on Computational Logic, 17:2, (1-30), Online publication date: 28-Mar-2016.
  61. ACM
    Schäfer S, Schneider S and Smolka G Axiomatic semantics for compiler verification Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (188-196)
  62. Kido K, Chaudhuri S and Hasuo I Abstract Interpretation with Infinitesimals Proceedings of the 17th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 9583, (229-249)
  63. ACM
    Hammer M, Dunfield J, Headley K, Labich N, Foster J, Hicks M and Van Horn D (2015). Incremental computation with names, ACM SIGPLAN Notices, 50:10, (748-766), Online publication date: 18-Dec-2015.
  64. Knight S, Maubert B and Schwarzentruber F Asynchronous Announcements in a Public Channel Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (272-289)
  65. ACM
    Latombe F, Crégut X, Combemale B, Deantoni J and Pantel M Weaving concurrency in executable domain-specific modeling languages Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, (125-136)
  66. ACM
    Hammer M, Dunfield J, Headley K, Labich N, Foster J, Hicks M and Van Horn D Incremental computation with names Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (748-766)
  67. ACM
    Gammie P, Hosking A and Engelhardt K (2015). Relaxing safely: verified on-the-fly garbage collection for x86-TSO, ACM SIGPLAN Notices, 50:6, (99-109), Online publication date: 7-Aug-2015.
  68. ACM
    Gammie P, Hosking A and Engelhardt K Relaxing safely: verified on-the-fly garbage collection for x86-TSO Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, (99-109)
  69. ACM
    Giacobazzi R, Logozzo F and Ranzato F (2015). Analyzing Program Analyses, ACM SIGPLAN Notices, 50:1, (261-273), Online publication date: 11-May-2015.
  70. ACM
    Giacobazzi R, Logozzo F and Ranzato F Analyzing Program Analyses Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (261-273)
  71. Medeiros S, Mascarenhas F and Ierusalimschy R (2014). Left recursion in Parsing Expression Grammars, Science of Computer Programming, 96:P2, (177-190), Online publication date: 15-Dec-2014.
  72. Duan Z and Tian C (2014). A practical decision procedure for Propositional Projection Temporal Logic with infinite models, Theoretical Computer Science, 554:C, (169-190), Online publication date: 16-Oct-2014.
  73. ACM
    Jung A (2014). Semantics column, ACM SIGLOG News, 1:2, (25-37), Online publication date: 14-Oct-2014.
  74. ACM
    Jafari M, Safavi-Naini R, Fong P and Barker K (2014). A Framework for Expressing and Enforcing Purpose-Based Privacy Policies, ACM Transactions on Information and System Security, 17:1, (1-31), Online publication date: 1-Aug-2014.
  75. ACM
    Mamouras K On the Hoare theory of monadic recursion schemes Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (1-10)
  76. ACM
    Midtgaard J, Brabrand C and Wasowski A Systematic derivation of static analyses for software product lines Proceedings of the 13th international conference on Modularity, (181-192)
  77. ACM
    Casinghino C, Sjöberg V and Weirich S (2014). Combining proofs and programs in a dependently typed language, ACM SIGPLAN Notices, 49:1, (33-45), Online publication date: 13-Jan-2014.
  78. ACM
    Itzhaky S, Banerjee A, Immerman N, Lahav O, Nanevski A and Sagiv M (2014). Modular reasoning about heap paths via effectively propositional formulas, ACM SIGPLAN Notices, 49:1, (385-396), Online publication date: 13-Jan-2014.
  79. ACM
    Casinghino C, Sjöberg V and Weirich S Combining proofs and programs in a dependently typed language Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (33-45)
  80. ACM
    Itzhaky S, Banerjee A, Immerman N, Lahav O, Nanevski A and Sagiv M Modular reasoning about heap paths via effectively propositional formulas Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (385-396)
  81. ACM
    Gammie P (2013). Synchronous digital circuits as functional programs, ACM Computing Surveys, 46:2, (1-27), Online publication date: 1-Nov-2013.
  82. Brucker A and Wolff B (2013). On theorem prover-based testing, Formal Aspects of Computing, 25:5, (683-721), Online publication date: 1-Sep-2013.
  83. Goncharov S and Schroder L A Relatively Complete Generic Hoare Logic for Order-Enriched Effects Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (273-282)
  84. Spaccasassi C and Koutavas V Towards Efficient Abstractions for Concurrent Consensus Revised Selected Papers of the 14th International Symposium on Trends in Functional Programming - Volume 8322, (76-90)
  85. ACM
    Hahn M, Motz R, Pardo A and Musicante M Formal semantics and expressiveness of a web service composition language Proceedings of the 28th Annual ACM Symposium on Applied Computing, (1667-1673)
  86. Jeannin J, Kozen D and Silva A Language constructs for non-well-founded computation Proceedings of the 22nd European conference on Programming Languages and Systems, (61-80)
  87. ACM
    Vytiniotis D, Peyton Jones S, Claessen K and Rosén D (2013). HALO, ACM SIGPLAN Notices, 48:1, (431-442), Online publication date: 23-Jan-2013.
  88. ACM
    Vytiniotis D, Peyton Jones S, Claessen K and Rosén D HALO Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (431-442)
  89. ACM
    Devriese D, Sergey I, Clarke D and Piessens F Fixing idioms Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation, (97-106)
  90. Biondi F, Legay A, Malacaria P and Wąsowski A Quantifying Information Leakage of Randomized Protocols Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737, (68-87)
  91. ACM
    Micciancio D and Tessaro S An equational approach to secure multi-party computation Proceedings of the 4th conference on Innovations in Theoretical Computer Science, (355-372)
  92. Duan Z, Ma Q, Tian C and Zhang N Some fixed-point issues in PPTL Theories of Programming and Formal Methods, (151-165)
  93. Zhang G (2013). Chu Spaces, Concept Lattices, and Domains, Electronic Notes in Theoretical Computer Science (ENTCS), 83, (287-302), Online publication date: 1-Jan-2013.
  94. ACM
    Falke S (2012). Review of transitions and trees, ACM SIGACT News, 43:4, (34-37), Online publication date: 19-Dec-2012.
  95. ACM
    Rosu G and Stefanescu A (2012). Checking reachability using matching logic, ACM SIGPLAN Notices, 47:10, (555-574), Online publication date: 15-Nov-2012.
  96. ACM
    Rosu G and Stefanescu A Checking reachability using matching logic Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (555-574)
  97. ACM
    Majumdar R, Saha I and Zamani M Synthesis of minimal-error control software Proceedings of the tenth ACM international conference on Embedded software, (123-132)
  98. Vorobyov K, Krishnan P and Stocks P A low-overhead, value-tracking approach to information flow security Proceedings of the 10th international conference on Software Engineering and Formal Methods, (367-381)
  99. ACM
    Raman R, Zhao J, Sarkar V, Vechev M and Yahav E (2012). Scalable and precise dynamic datarace detection for structured parallelism, ACM SIGPLAN Notices, 47:6, (531-542), Online publication date: 6-Aug-2012.
  100. Hasuo I and Suenaga K Exercises in nonstandard static analysis of hybrid systems Proceedings of the 24th international conference on Computer Aided Verification, (462-478)
  101. Dinges P and Agha G Scoped synchronization constraints for large scale actor systems Proceedings of the 14th international conference on Coordination Models and Languages, (89-103)
  102. ACM
    Raman R, Zhao J, Sarkar V, Vechev M and Yahav E Scalable and precise dynamic datarace detection for structured parallelism Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, (531-542)
  103. ACM
    Hatcliff J, Leavens G, Leino K, Müller P and Parkinson M (2012). Behavioral interface specification languages, ACM Computing Surveys, 44:3, (1-58), Online publication date: 1-Jun-2012.
  104. Nipkow T Teaching semantics with a proof assistant Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation, (24-38)
  105. Jeannin J Capsules and closures Logic and Program Semantics, (106-123)
  106. Ouaknine J, Palikareva H, Roscoe A and Worrell J Static livelock analysis in CSP Proceedings of the 22nd international conference on Concurrency theory, (389-403)
  107. ACM
    Chaudhuri S, Gulwani S, Lublinerman R and Navidpour S Proving programs robust Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, (102-112)
  108. Case J and Moelius III S (2011). Properties Complementary to Program Self-Reference, Fundamenta Informaticae, 111:3, (281-311), Online publication date: 1-Aug-2011.
  109. Suenaga K and Hasuo I Programming with infinitesimals Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (392-403)
  110. Xu Y, Ramanathan J, Ramnath R, Singh N and Deshpande S Reuse by placement Proceedings of the 12th international conference on Top productivity through software reuse, (69-77)
  111. ACM
    Birgisson A, Russo A and Sabelfeld A Capabilities for information flow Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security, (1-15)
  112. ACM
    Taha W, Brauner P, Cartwright R, Gaspes V, Ames A and Chapoutot A (2011). A core language for executable models of cyber physical systems, ACM SIGBED Review, 8:2, (39-43), Online publication date: 1-Jun-2011.
  113. Costa G, Degano P and Martinelli F (2011). Secure service orchestration in open networks, Journal of Systems Architecture: the EUROMICRO Journal, 57:3, (231-239), Online publication date: 1-Mar-2011.
  114. ACM
    Attiya H, Guerraoui R, Hendler D, Kuznetsov P, Michael M and Vechev M Laws of order Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (487-498)
  115. ACM
    Henglein F and Nielsen L Regular expression containment Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (385-398)
  116. ACM
    Attiya H, Guerraoui R, Hendler D, Kuznetsov P, Michael M and Vechev M (2011). Laws of order, ACM SIGPLAN Notices, 46:1, (487-498), Online publication date: 26-Jan-2011.
  117. ACM
    Henglein F and Nielsen L (2011). Regular expression containment, ACM SIGPLAN Notices, 46:1, (385-398), Online publication date: 26-Jan-2011.
  118. Birgisson A, Russo A and Sabelfeld A Unifying facets of information integrity Proceedings of the 6th international conference on Information systems security, (48-65)
  119. Duan Z and Tian C An improved decision procedure for propositional projection temporal logic Proceedings of the 12th international conference on Formal engineering methods and software engineering, (90-105)
  120. ACM
    Anta A, Majumdar R, Saha I and Tabuada P Automatic verification of control system implementations Proceedings of the tenth ACM international conference on Embedded software, (9-18)
  121. Autexier S and Lüth C Adding change impact analysis to the formal verification of C programs Proceedings of the 8th international conference on Integrated formal methods, (59-73)
  122. Kainz G, Buckl C, Sommer S and Knoll A Model-to-metamodel transformation for the development of component-based systems Proceedings of the 13th international conference on Model driven engineering languages and systems: Part II, (391-405)
  123. Monitoring temporal SystemC properties Proceedings of the Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign, (123-132)
  124. Malacaria P and Heusser J Information theory and security Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems, (87-134)
  125. ACM
    Malecha G and Chong S A more precise security type system for dynamic security tests Proceedings of the 5th ACM SIGPLAN Workshop on Programming Languages and Analysis for Security, (1-12)
  126. Malacaria P (2010). Risk assessment of security threats for looping constructs, Journal of Computer Security, 18:2, (191-228), Online publication date: 1-Apr-2010.
  127. ACM
    Cortesi A and Halder R Dependence condition graph for semantics-based abstract program slicing Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications, (1-6)
  128. Costa G, Degano P and Martinelli F Modular plans for secure service composition Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security, (41-58)
  129. Kiselyov O Typed tagless final interpreters Proceedings of the 2010 international spring school conference on Generic and Indexed Programming, (130-174)
  130. King D, Jha S, Muthukumaran D, Jaeger T, Jha S and Seshia S Automating security mediation placement Proceedings of the 19th European conference on Programming Languages and Systems, (327-344)
  131. Collinson M, Monahan B and Pym D Semantics for structured systems modelling and simulation Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, (1-8)
  132. Zhuge H (2010). Interactive semantics, Artificial Intelligence, 174:2, (190-204), Online publication date: 1-Feb-2010.
  133. ACM
    Chaudhuri S, Gulwani S and Lublinerman R Continuity analysis of programs Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (57-70)
  134. ACM
    Chaudhuri S, Gulwani S and Lublinerman R (2010). Continuity analysis of programs, ACM SIGPLAN Notices, 45:1, (57-70), Online publication date: 2-Jan-2010.
  135. Balliu M and Mastroeni I A weakest precondition approach to robustness Transactions on computational science X, (261-297)
  136. Costa G, Degano P and Martinelli F Secure Service Composition with Symbolic Effects Proceedings of the 2009 Fourth South-East European Workshop on Formal Methods, (3-9)
  137. Bartoletti M, Degano P and Ferrari G (2009). Planning and verifying service composition, Journal of Computer Security, 17:5, (799-837), Online publication date: 1-Oct-2009.
  138. Clarkson M, Myers A and Schneider F (2009). Quantifying information flow with beliefs, Journal of Computer Security, 17:5, (655-701), Online publication date: 1-Oct-2009.
  139. Winskel G (2009). Prime algebraicity, Theoretical Computer Science, 410:41, (4160-4168), Online publication date: 1-Sep-2009.
  140. ACM
    Benton N and Hur C (2009). Biorthogonality, step-indexing and compiler correctness, ACM SIGPLAN Notices, 44:9, (97-108), Online publication date: 31-Aug-2009.
  141. ACM
    Benton N and Hur C Biorthogonality, step-indexing and compiler correctness Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, (97-108)
  142. Brown D and Pucella R (2009). Categories of Timed Stochastic Relations, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (193-217), Online publication date: 1-Aug-2009.
  143. Castro P, Panangaden P and Precup D Equivalence relations in fully and partially observable Markov decision processes Proceedings of the 21st International Joint Conference on Artificial Intelligence, (1653-1658)
  144. ACM
    Balliu M and Mastroeni I A weakest precondition approach to active attacks analysis Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security, (59-71)
  145. Grönniger H, Ringert J and Rumpe B System Model-Based Definition of Modeling Language Semantics Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems, (152-166)
  146. ACM
    Abadi M and Plotkin G (2009). A model of cooperative threads, ACM SIGPLAN Notices, 44:1, (29-40), Online publication date: 21-Jan-2009.
  147. ACM
    Abadi M and Plotkin G A model of cooperative threads Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (29-40)
  148. ACM
    Costa M, Crowcroft J, Castro M, Rowstron A, Zhou L, Zhang L and Barham P (2008). Vigilante, ACM Transactions on Computer Systems, 26:4, (1-68), Online publication date: 1-Dec-2008.
  149. Liu X and Lee E (2008). CPO semantics of timed interactive actor networks, Theoretical Computer Science, 409:1, (110-125), Online publication date: 1-Dec-2008.
  150. Tabakov D, Vardi M, Kamhi G and Singerman E A temporal language for SystemC Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, (1-9)
  151. Brucker A and Wolff B (2008). An Extensible Encoding of Object-oriented Data Models in hol, Journal of Automated Reasoning, 41:3-4, (219-249), Online publication date: 1-Nov-2008.
  152. ACM
    Roberson M, Harries M, Darga P and Boyapati C (2008). Efficient software model checking of soundness of type systems, ACM SIGPLAN Notices, 43:10, (493-504), Online publication date: 27-Oct-2008.
  153. ACM
    Roberson M, Harries M, Darga P and Boyapati C Efficient software model checking of soundness of type systems Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications, (493-504)
  154. ACM
    Morris J and Tyrrell M (2008). Dually nondeterministic functions, ACM Transactions on Programming Languages and Systems, 30:6, (1-34), Online publication date: 1-Oct-2008.
  155. ACM
    Danvy O (2008). Defunctionalized interpreters for programming languages, ACM SIGPLAN Notices, 43:9, (131-142), Online publication date: 27-Sep-2008.
  156. ACM
    Danvy O Defunctionalized interpreters for programming languages Proceedings of the 13th ACM SIGPLAN international conference on Functional programming, (131-142)
  157. Moreno-Ger P, Burgos D, Martínez-Ortiz I, Sierra J and Fernández-Manjón B (2008). Educational game design for online education, Computers in Human Behavior, 24:6, (2530-2540), Online publication date: 17-Sep-2008.
  158. ACM
    Bertot Y and Komendantsky V Fixed point semantics and partial recursion in Coq Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (89-96)
  159. Vardoulakis D and Wand M A compositional trace semantics for Orc Proceedings of the 10th international conference on Coordination models and languages, (331-346)
  160. ACM
    Monniaux D (2008). The pitfalls of verifying floating-point computations, ACM Transactions on Programming Languages and Systems, 30:3, (1-41), Online publication date: 1-May-2008.
  161. Velroyen H and Rümmer P Non-termination checking for imperative programs Proceedings of the 2nd international conference on Tests and proofs, (154-170)
  162. ACM
    Zhou Y and Lee E (2008). Causality interfaces for actor networks, ACM Transactions on Embedded Computing Systems, 7:3, (1-35), Online publication date: 1-Apr-2008.
  163. Danvy O and Millikin K (2008). On the equivalence between small-step and big-step abstract machines, Information Processing Letters, 106:3, (100-109), Online publication date: 1-Apr-2008.
  164. Bouissou O and Martel M A hybrid denotational semantics for hybrid systems Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems, (63-77)
  165. ACM
    Mastroeni I and Zanardini D Data dependencies and program slicing Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (125-134)
  166. Spoto F (2007). Optimality and condensing of information flow through linear refinement, Theoretical Computer Science, 388:1-3, (53-82), Online publication date: 1-Dec-2007.
  167. Sprinkle J, Rumpe B, Vangheluwe H and Karsai G Metamodelling Proceedings of the 2007 International Dagstuhl conference on Model-based engineering of embedded real-time systems, (57-76)
  168. Affeldt R, Tanaka M and Marti N Formal proof of provable security by game-playing in a proof assistant Proceedings of the 1st international conference on Provable security, (151-168)
  169. Hillebrand M and Paul W On the architecture of system verification environments Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing, (153-168)
  170. Nain S and Vardi M Branching vs. linear time Proceedings of the 5th international conference on Automated technology for verification and analysis, (19-34)
  171. ACM
    Costa M, Castro M, Zhou L, Zhang L and Peinado M (2007). Bouncer, ACM SIGOPS Operating Systems Review, 41:6, (117-130), Online publication date: 14-Oct-2007.
  172. ACM
    Costa M, Castro M, Zhou L, Zhang L and Peinado M Bouncer Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, (117-130)
  173. Kiehn A (2007). An Operational Semantics for Shared Messaging Communication, Electronic Notes in Theoretical Computer Science (ENTCS), 192:1, (77-92), Online publication date: 1-Oct-2007.
  174. Sprenger C and Basin D A monad-based modeling and verification toolbox with application to security protocols Proceedings of the 20th international conference on Theorem proving in higher order logics, (302-318)
  175. Tesson J and Loulergue F Formal semantics of DRMA-style programming in BSPlib Proceedings of the 7th international conference on Parallel processing and applied mathematics, (1122-1129)
  176. Axelsen H, Glück R and Yokoyama T Reversible machine code and its abstract processor architecture Proceedings of the Second international conference on Computer Science: theory and applications, (56-69)
  177. Payet É and Spoto F Magic-sets transformation for the analysis of java bytecode Proceedings of the 14th international conference on Static Analysis, (452-467)
  178. Monniaux D Optimal abstraction on real-valued programs Proceedings of the 14th international conference on Static Analysis, (104-120)
  179. Bossi A, Piazza C and Rossi S (2007). Compositional information flow security for concurrent programs, Journal of Computer Security, 15:3, (373-416), Online publication date: 1-Aug-2007.
  180. Turner R (2007). Understanding Programming Languages, Minds and Machines, 17:2, (203-216), Online publication date: 1-Jul-2007.
  181. Case J and Moeliusiii S Characterizing Programming Systems Allowing Program Self-reference Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (125-134)
  182. Chalin P A Sound Assertion Semantics for the Dependable Systems Evolution Verifying Compiler Proceedings of the 29th international conference on Software Engineering, (23-33)
  183. ACM
    Foster J, Greenwald M, Moore J, Pierce B and Schmitt A (2007). Combinators for bidirectional tree transformations, ACM Transactions on Programming Languages and Systems, 29:3, (17-es), Online publication date: 1-May-2007.
  184. Filinski A (2007). On the relations between monadic semantics, Theoretical Computer Science, 375:1-3, (41-75), Online publication date: 20-Apr-2007.
  185. Kirchner F and Sinot F (2007). Rule-Based Operational Semantics for an Imperative Language, Electronic Notes in Theoretical Computer Science (ENTCS), 174:1, (35-47), Online publication date: 1-Apr-2007.
  186. Nistal J, Brañas E, Ferro A and Souto D On the representation of imperative programs in a logical framework Proceedings of the 11th international conference on Computer aided systems theory, (202-209)
  187. ACM
    Malacaria P Assessing security threats of looping constructs Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (225-235)
  188. ACM
    Malacaria P (2007). Assessing security threats of looping constructs, ACM SIGPLAN Notices, 42:1, (225-235), Online publication date: 17-Jan-2007.
  189. Fan Z and Jiang Y Operator component matrix model for IMP program diagnosis Proceedings of the 20th international joint conference on Artifical intelligence, (354-359)
  190. Jones C Understanding programming language concepts via operational semantics Domain modeling and the duration calculus, (177-235)
  191. Hofstedt P and Pepper P (2007). Integration of declarative and constraint programming, Theory and Practice of Logic Programming, 7:1-2, (93-121), Online publication date: 1-Jan-2007.
  192. Russo A, Hughes J, Naumann D and Sabelfeld A Closing internal timing channels by transformation Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues, (120-135)
  193. ACM
    Zhou Y and Lee E A causality interface for deadlock analysis in dataflow Proceedings of the 6th ACM & IEEE International conference on Embedded software, (44-52)
  194. ACM
    Mount S, Newman R and Low R ICODE Proceedings of the 24th annual ACM international conference on Design of communication, (121-128)
  195. Lee E Concurrent semantics without the notions of state or state transitions Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems, (18-31)
  196. Allamigeon X, Godard W and Hymans C Static analysis of string manipulations in critical embedded c programs Proceedings of the 13th international conference on Static Analysis, (35-51)
  197. Levy P Jumbo λ-calculus Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (444-455)
  198. ACM
    Boute R (2006). Calculational semantics, ACM Transactions on Programming Languages and Systems, 28:4, (747-793), Online publication date: 1-Jul-2006.
  199. Russo A and Sabelfeld A Security for multithreaded programs under cooperative scheduling Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics, (474-480)
  200. Kastenberg H, Kleppe A and Rensink A Defining object-oriented execution semantics using graph transformations Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (186-201)
  201. Myers A, Sabelfeld A and Zdancewic S (2006). Enforcing robust declassification and qualified robustness, Journal of Computer Security, 14:2, (157-196), Online publication date: 20-Apr-2006.
  202. Sulzmann M and Lu K (2006). A Type-Safe Embedding of XDuce into ML, Electronic Notes in Theoretical Computer Science (ENTCS), 148:2, (239-264), Online publication date: 1-Mar-2006.
  203. Rossignoli S and Spoto F Detecting non-cyclicity by abstract compilation into boolean functions Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation, (95-110)
  204. Xu J and Zucker J (2005). First and Second Order Recursion on Abstract Data Types, Fundamenta Informaticae, 67:4, (377-419), Online publication date: 1-Dec-2005.
  205. ACM
    Banerjee A and Naumann D (2005). Ownership confinement ensures representation independence for object-oriented programs, Journal of the ACM, 52:6, (894-960), Online publication date: 1-Nov-2005.
  206. Hillebrand M, Rieden T and Paul W Dealing with I/O Devices in the Context of Pervasive System Verification Proceedings of the 2005 International Conference on Computer Design, (309-316)
  207. Leinenbach D, Paul W and Petrova E Towards the Formal Verification of a C0 Compiler Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (2-12)
  208. Secci S and Spoto F Pair-sharing analysis of object-oriented programs Proceedings of the 12th international conference on Static Analysis, (320-335)
  209. Gargano M, Hillebrand M, Leinenbach D and Paul W On the correctness of operating system kernels Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (1-16)
  210. Brucker A and Wolff B Interactive testing with HOL-TestGen Proceedings of the 5th international conference on Formal Approaches to Software Testing, (87-102)
  211. Wildmoser M and Nipkow T Asserting bytecode safety Proceedings of the 14th European conference on Programming Languages and Systems, (326-341)
  212. Ennals R, Sharp R and Mycroft A Task partitioning for multi-core network processors Proceedings of the 14th international conference on Compiler Construction, (76-90)
  213. Xu J and Zucker J (2005). First and Second Order Recursion on Abstract Data Types, Fundamenta Informaticae, 67:4, (377-419), Online publication date: 1-Mar-2005.
  214. Meyer T and Wolff B Tactic-based optimized compilation of functional programs Proceedings of the 2004 international conference on Types for Proofs and Programs, (201-214)
  215. Escardó M (2004). Synthetic Topology, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (21-156), Online publication date: 1-Nov-2004.
  216. ACM
    Wand M and Vaillancourt D Relating models of backtracking Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, (54-65)
  217. ACM
    Wand M and Vaillancourt D (2004). Relating models of backtracking, ACM SIGPLAN Notices, 39:9, (54-65), Online publication date: 19-Sep-2004.
  218. Danvy O A rational deconstruction of landin's SECD machine Proceedings of the 16th international conference on Implementation and Application of Functional Languages, (52-71)
  219. Lacey D, Jones N, Van Wyk E and Frederiksen C (2004). Compiler Optimization Correctness by Temporal Logic, Higher-Order and Symbolic Computation, 17:3, (173-206), Online publication date: 1-Sep-2004.
  220. Bossi A, Piazza C and Rossi S Unwinding conditions for security in imperative languages Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation, (85-100)
  221. Ager M From natural semantics to abstract machines Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation, (245-261)
  222. ACM
    Honda K and Yoshida N A compositional logic for polymorphic higher-order functions Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, (191-202)
  223. Ferns N, Panangaden P and Precup D Metrics for finite Markov decision processes Proceedings of the 20th conference on Uncertainty in artificial intelligence, (162-169)
  224. Stauner T (2004). Properties of Hybrid Systems—A Computer Science Perspective, Formal Methods in System Design, 24:3, (223-259), Online publication date: 1-May-2004.
  225. ACM
    Mosses P Exploiting labels in Structural Operational Semantics Proceedings of the 2004 ACM symposium on Applied computing, (1476-1481)
  226. ACM
    Giacobazzi R and Mastroeni I Abstract non-interference Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (186-197)
  227. ACM
    Benton N Simple relational correctness proofs for static analyses and program transformations Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (14-25)
  228. Mosses P (2004). Exploiting Labels in Structural Operational Semantics, Fundamenta Informaticae, 60:1-4, (17-31), Online publication date: 1-Jan-2004.
  229. ACM
    Giacobazzi R and Mastroeni I (2004). Abstract non-interference, ACM SIGPLAN Notices, 39:1, (186-197), Online publication date: 1-Jan-2004.
  230. ACM
    Benton N (2004). Simple relational correctness proofs for static analyses and program transformations, ACM SIGPLAN Notices, 39:1, (14-25), Online publication date: 1-Jan-2004.
  231. Giacobazzi R and Mastroeni I (2003). Non-Standard Semantics for Program Slicing, Higher-Order and Symbolic Computation, 16:4, (297-339), Online publication date: 1-Dec-2003.
  232. Homeier P and Martin D (2003). Secure mechanical verification of mutually recursive procedures, Information and Computation, 187:1, (1-19), Online publication date: 25-Nov-2003.
  233. Mosses P (2003). Exploiting Labels in Structural Operational Semantics, Fundamenta Informaticae, 60:1-4, (17-31), Online publication date: 1-Sep-2003.
  234. ACM
    Ager M, Biernacki D, Danvy O and Midtgaard J A functional correspondence between evaluators and abstract machines Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, (8-19)
  235. Oury N Observational equivalence and program extraction in the Coq proof assistant Proceedings of the 6th international conference on Typed lambda calculi and applications, (271-285)
  236. ACM
    Bierman G Formal semantics and analysis of object queries Proceedings of the 2003 ACM SIGMOD international conference on Management of data, (407-418)
  237. Danvy O and López P Tagging, encoding, and jones optimality Proceedings of the 12th European conference on Programming, (335-347)
  238. Lencevicius R, Hölzle U and Singh A (2003). Dynamic Query-Based Debugging of Object-Oriented Programs, Automated Software Engineering, 10:1, (39-74), Online publication date: 1-Jan-2003.
  239. ACM
    Wooldridge M, Fisher M, Huget M and Parsons S Model checking multi-agent systems with MABLE Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (952-959)
  240. Setzer A Java as a functional programming language Proceedings of the 2002 international conference on Types for proofs and programs, (279-298)
  241. Brucker A and Wolff B Using theory morphisms for implementing formal methods tools Proceedings of the 2002 international conference on Types for proofs and programs, (59-77)
  242. ACM
    Giacobazzi R and Mastroeni I (2002). Compositionality in the puzzle of semantics, ACM SIGPLAN Notices, 37:3, (87-97), Online publication date: 1-Mar-2002.
  243. ACM
    Lacey D, Jones N, Van Wyk E and Frederiksen C Proving correctness of compiler optimizations by temporal logic Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (283-294)
  244. ACM
    Hofmann M The strength of non-size increasing computation Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (260-269)
  245. ACM
    Giacobazzi R and Mastroeni I Compositionality in the puzzle of semantics Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (87-97)
  246. ACM
    Lacey D, Jones N, Van Wyk E and Frederiksen C (2002). Proving correctness of compiler optimizations by temporal logic, ACM SIGPLAN Notices, 37:1, (283-294), Online publication date: 1-Jan-2002.
  247. ACM
    Hofmann M (2002). The strength of non-size increasing computation, ACM SIGPLAN Notices, 37:1, (260-269), Online publication date: 1-Jan-2002.
  248. ACM
    Fernández-Breis J, Castellanos-Nieves D, Valencia-Garcia R, Vivancos-Vicente P, Martínez Béjar R and Heras-Gónzalez M Towards scott domains-based topological ontology models Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001, (127-138)
  249. Damian D and Danvy O Static transition compression Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation, (92-107)
  250. ACM
    Danvy O and Nielsen L Defunctionalization at work Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (162-174)
  251. Thirunarayan K and Ewing R (2001). Structural Operational Semantics for a Portable Subset of Behavioral VHDL-93, Formal Methods in System Design, 18:1, (69-88), Online publication date: 1-Jan-2001.
  252. ACM
    Erkök L and Launchbury J (2000). Recursive monadic bindings, ACM SIGPLAN Notices, 35:9, (174-185), Online publication date: 1-Sep-2000.
  253. ACM
    Erkök L and Launchbury J Recursive monadic bindings Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, (174-185)
  254. Ben-Asher Y and Stein E (2000). Basic Results in Automatic Transformations of Shared Memory Parallel Programs into Sequential Programs, The Journal of Supercomputing, 17:2, (143-165), Online publication date: 1-Sep-2000.
  255. Simpson A and Plotkin G Complete Axioms for Categorical Fixed-Point Operators Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
  256. ACM
    Taha W A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (34-43)
  257. ACM
    Taha W (1999). A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival, ACM SIGPLAN Notices, 34:11, (34-43), Online publication date: 1-Nov-1999.
  258. Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
  259. Braüner T (1998). A Simple Adequate Categorical Model for PCF, II, Fundamenta Informaticae, 33:4, (339-368), Online publication date: 1-Dec-1998.
  260. Hatcliff J An Introduction to Online and Offline Partial Evaluation using a Simple Flowchart Language Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, (20-82)
  261. ACM
    Haynes C (1998). Experience with an analytic approach to teaching programming languages, ACM SIGCSE Bulletin, 30:1, (350-354), Online publication date: 1-Mar-1998.
  262. ACM
    Haynes C Experience with an analytic approach to teaching programming languages Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, (350-354)
  263. ACM
    Kitchen A (1998). A formal approach to the teaching of programming language concepts, ACM SIGPLAN Notices, 33:2, (48-55), Online publication date: 1-Feb-1998.
  264. ACM
    Marinescu M and Goldberg B (1997). Partial-evaluation techniques for concurrent programs, ACM SIGPLAN Notices, 32:12, (47-62), Online publication date: 1-Dec-1997.
  265. ACM
    Marinescu M and Goldberg B Partial-evaluation techniques for concurrent programs Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (47-62)
  266. Dechering P, Breebaart L, Kuijlman F, Reeuwijk K and Sips H Semantics and Implementation of a Generalized forall Statement for Parallel Languages Proceedings of the 11th International Symposium on Parallel Processing, (542-548)
  267. Lee E and Sangiovanni-Vincentelli A Comparing models of computation Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (234-241)
  268. ACM
    Kennedy A Relational parametricity and units of measure Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (442-455)
  269. Smith S and Pedersen P Organizing electronic services into security taxonomies Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2, (14-14)
  270. McCusker G Games and Full Abstraction for FPC Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  271. Natarajan V and Cleaveland R An Algebraic Theory of Process Efficiency Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  272. A Formal Approach to Model SNMP Network Management Systems Proceedings of the 4th International Conference on Computer Communications and Networks
Contributors
  • University of Strathclyde

Reviews

Gudula Rünger

The mathematics, techniques, and concepts of operational, denotational, and axiomatic semantics are presented. This introductory book is primarily addressed to undergraduate and graduate students, so it starts with basic material. But more advanced material on topics of recent research is also provided. The book comprises 14 chapters. Basic notations of logic and set theory are given in the first chapter. Chapter 2 introduces the structural operational semantics for a simple imperative language of while programs, IMP. Detailed material on inductive proof principles and inductive definitions is provided in chapters 3 and 4. Chapter 5 continues with a denotational semantics for IMP and an equivalence proof of the introduced operational and denotational semantics. Chapters 6 and 7 are devoted to the axiomatic Hoare-style semantics and completeness aspects of Hoare rules. A detailed introduction to the theory of complete partial orders and &lgr;-notation is given in chapter 8. With the simple applicative language REC, supporting recursive definitions, chapter 9 discusses call-by-value and call-by-name evaluation of languages. Again, an operational and a denotational semantics and their equivalence for both cases are completely worked out. The treatment of recursive definitions is extended in chapter 10. The different semantic descriptions for languages with higher types, treating functions as first-order elements, follow in chapter 11, leading to the concept of full abstraction. The next two chapters are dedicated to recursive types. Recursive domain equations are solved by information systems. The last chapter treats parallelism and nondeterminism, including guarded commands, calculus of communicating systems (CCS), and local model checking. An appendix contains a brief introduction to the theory of computation, based on a notation of A. Meyer, which is used for chapters 1 through 7. This carefully written book achieves its purpose of being an introductory book on semantics, leading the reader from basic material to recent research topics . The text is accompanied by exercises of varying difficulty. At the end of each chapter, the author cites original works on which the presentation is based and gives further readings. I recommend this book not only as a basis for introductory courses but also for independent study by people interested in semantics.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Recommendations