No abstract available.
Cited By
- Zhou L, Wan Q and Oliveira B (2024). Full Iso-Recursive Types, Proceedings of the ACM on Programming Languages, 8:OOPSLA2, (192-221), Online publication date: 8-Oct-2024.
- Goncharov S, Milius S, Tsampas S and Urbat H Bialgebraic Reasoning on Higher-order Program Equivalence Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-15)
- Blouin A (2024). A Type System for Flexible User Interactions Handling, Proceedings of the ACM on Human-Computer Interaction, 8:EICS, (1-27), Online publication date: 17-Jun-2024.
- Zhang L, Liu C, Xu Z, Chen S, Fan L, Chen B and Liu Y Has My Release Disobeyed Semantic Versioning? Static Detection Based on Semantic Differencing Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, (1-12)
- Fortas A, Kerkouche E and Chaoui A (2022). Formal verification of IoT applications using rewriting logic, Science of Computer Programming, 222:C, Online publication date: 1-Oct-2022.
- Kavvos G, Morehouse E, Licata D and Danner N (2019). Recurrence extraction for functional programs through call-by-push-value, Proceedings of the ACM on Programming Languages, 4:POPL, (1-31), Online publication date: 1-Jan-2020.
- Fu Y, Liu J, Shi X, Tsai M, Wang B and Yang B Signed Cryptographic Program Verification with Typed CryptoLine Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1591-1606)
- Nishizaki S ML Polymorphism of Linear Lambda Calculus with First-class Continuations Proceedings of the 2019 8th International Conference on Software and Computer Applications, (189-193)
- Guagliardo P and Libkin L (2017). A formal semantics of SQL queries, its validation, and applications, Proceedings of the VLDB Endowment, 11:1, (27-39), Online publication date: 1-Sep-2017.
- Asada K, Sato R and Kobayashi N (2017). Verifying relational properties of functional programs by first-order refinement, Science of Computer Programming, 137:C, (2-62), Online publication date: 1-Apr-2017.
- Murawski A and Tzevelekos N (2016). Nominal Game Semantics, Foundations and Trends in Programming Languages, 2:4, (191-269), Online publication date: 1-Mar-2016.
- (2016). Certain answers as objects and knowledge, Artificial Intelligence, 232:C, (1-19), Online publication date: 1-Mar-2016.
- Libkin L How to define certain answers Proceedings of the 24th International Conference on Artificial Intelligence, (4282-4288)
- Gheerbrant A, Libkin L and Sirangelo C (2014). Naïve Evaluation of Queries over Incomplete Databases, ACM Transactions on Database Systems, 39:4, (1-42), Online publication date: 30-Dec-2015.
- Tamura G, Casallas R, Cleve A and Duchien L (2014). QoS contract preservation through dynamic reconfiguration, Science of Computer Programming, 94:P3, (307-332), Online publication date: 1-Nov-2014.
- Jung A (2014). Semantics column, ACM SIGLOG News, 1:2, (25-37), Online publication date: 14-Oct-2014.
- Nadas A, Levendovszky T, Jackson E, Madari I and Sztipanovits J (2014). A model-integrated authoring environment for privacy policies, Science of Computer Programming, 89:PB, (105-125), Online publication date: 1-Sep-2014.
- Nunes-Harwitt A Eager Evaluation Isn't Eager Enough A Transformation Based Approach to Semantics-Directed Code Generation Proceedings of ILC 2014 on 8th International Lisp Conference, (79-86)
- Libkin L Certain answers as objects and knowledge Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, (328-337)
- Backes M, Hriţcu C and Maffei M (2014). Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations, Journal of Computer Security, 22:2, (301-353), Online publication date: 1-Mar-2014.
- Gammie P (2013). Synchronous digital circuits as functional programs, ACM Computing Surveys, 46:2, (1-27), Online publication date: 1-Nov-2013.
- Purandare R, Dwyer M and Elbaum S Optimizing monitoring of finite state properties through monitor compaction Proceedings of the 2013 International Symposium on Software Testing and Analysis, (280-290)
- Gheerbrant A, Libkin L and Sirangelo C When is naive evaluation possible? Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, (75-86)
- 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)
- Thielecke H Functional semantics of parsing actions, and left recursion elimination as continuation passing Proceedings of the 14th symposium on Principles and practice of declarative programming, (91-102)
- Schmidt D (2012). Inverse-limit and topological aspects of abstract interpretation, Theoretical Computer Science, 430, (23-42), Online publication date: 1-Apr-2012.
- Blom C, de Groote P, Winter Y and Zwarts J Implicit arguments Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning, (240-250)
- Libkin L Incomplete information and certain answers in general data models Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (59-70)
- Chitil O A semantics for lazy assertions Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation, (141-150)
- Bengtson J, Bhargavan K, Fournet C, Gordon A and Maffeis S (2011). Refinement types for secure implementations, ACM Transactions on Programming Languages and Systems, 33:2, (1-45), Online publication date: 1-Jan-2011.
- Beaucamps P, Gnaedig I and Marion J Behavior abstraction in malware analysis Proceedings of the First international conference on Runtime verification, (168-182)
- Backes M, Maffei M and Unruh D Computationally sound verification of source code Proceedings of the 17th ACM conference on Computer and communications security, (387-398)
- Agrawal P, Sarma A, Ullman J and Widom J (2010). Foundations of uncertain-data integration, Proceedings of the VLDB Endowment, 3:1-2, (1080-1090), Online publication date: 1-Sep-2010.
- Clouston R (2010). Binding in Nominal Equational Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 265, (259-276), Online publication date: 1-Sep-2010.
- Berger M and Tratt L Program logics for homogeneous meta-programming Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (64-81)
- Bhargavan K, Fournet C and Gordon A Modular verification of security protocol code by typing Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (445-456)
- Bhargavan K, Fournet C and Gordon A (2010). Modular verification of security protocol code by typing, ACM SIGPLAN Notices, 45:1, (445-456), Online publication date: 2-Jan-2010.
- Harrison W and Hook J (2009). Achieving information flow security through monadic control of effects, Journal of Computer Security, 17:5, (599-653), Online publication date: 1-Oct-2009.
- Escardó M (2009). Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (219-242), Online publication date: 1-Aug-2009.
- 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.
- Schmidt D (2009). Abstract Interpretation From a Denotational-semantics Perspective, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (19-37), Online publication date: 1-Aug-2009.
- Miller D (2009). Formalizing Operational Semantic Specifications in Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 246, (147-165), Online publication date: 1-Aug-2009.
- Escardó M and Ho W (2009). Operational domain theory and topology of sequential programming languages, Information and Computation, 207:3, (411-437), Online publication date: 1-Mar-2009.
- Spreen D, Xu L and Mao X (2008). Information systems revisited – the general continuous case, Theoretical Computer Science, 405:1-2, (176-187), Online publication date: 1-Oct-2008.
- Paolini L and Piccolo M Semantically linear programming languages Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (97-107)
- Cuccuru A, Mraidha C, Terrier F and Grard S Enhancing UML extensions with operational semantics behaviored profiles with templates Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems, (271-285)
- Huima A Implementing conformiq Qtronic Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems, (1-12)
- Filinski A (2007). On the relations between monadic semantics, Theoretical Computer Science, 375:1-3, (41-75), Online publication date: 20-Apr-2007.
- Pym D and Tofts C (2007). Systems Modelling via Resources and Processes, Electronic Notes in Theoretical Computer Science (ENTCS), 172, (545-587), Online publication date: 1-Apr-2007.
- Pitts A and Shinwell M Generative unbinding of names Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (85-95)
- Pitts A and Shinwell M (2007). Generative unbinding of names, ACM SIGPLAN Notices, 42:1, (85-95), Online publication date: 17-Jan-2007.
- Pym D and Tofts C (2006). A Calculus and logic of resources and processes, Formal Aspects of Computing, 18:4, (495-517), Online publication date: 1-Dec-2006.
- Diskin Z and Dingel J Mappings, maps and tables Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems, (230-244)
- Honda K, Berger M and Yoshida N Descriptive and relative completeness of logics for higher-order functions Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (360-371)
- Crolard T, Lacas S and Valarcher P (2006). On the expressive power of the loop language, Nordic Journal of Computing, 13:1, (46-57), Online publication date: 1-Jun-2006.
- Pitts A (2006). Alpha-structural recursion and induction, Journal of the ACM, 53:3, (459-506), Online publication date: 1-May-2006.
- Ernst E, Ostermann K and Cook W (2006). A virtual class calculus, ACM SIGPLAN Notices, 41:1, (270-282), Online publication date: 12-Jan-2006.
- Ernst E, Ostermann K and Cook W A virtual class calculus Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (270-282)
- Harrison W A simple semantics for polymorphic recursion Proceedings of the Third Asian conference on Programming Languages and Systems, (37-51)
- Berger M, Honda K and Yoshida N A logical analysis of aliasing in imperative higher-order functions Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, (280-293)
- Berger M, Honda K and Yoshida N (2005). A logical analysis of aliasing in imperative higher-order functions, ACM SIGPLAN Notices, 40:9, (280-293), Online publication date: 12-Sep-2005.
- Pitts A Alpha-structural recursion and induction Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (17-34)
- Spreen D (2005). The largest Cartesian closed category of domains, considered constructively, Mathematical Structures in Computer Science, 15:2, (299-321), Online publication date: 1-Apr-2005.
- Escardó M (2004). Synthetic Topology, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (21-156), Online publication date: 1-Nov-2004.
- Honda K From process logic to program logic Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, (163-174)
- Honda K (2004). From process logic to program logic, ACM SIGPLAN Notices, 39:9, (163-174), Online publication date: 19-Sep-2004.
- 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)
- Krstić S and Matthews J Semantics of the reFL language Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, (32-42)
- McBurney P and Parsons S A Denotational Semantics for Deliberation Dialogues Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, (86-93)
- McBurney P and Parsons S A denotational semantics for deliberation dialogues Proceedings of the First international conference on Argumentation in Multi-Agent Systems, (162-175)
- Yoshida N, Berger M and Honda K (2004). Strong normalisation in the π-calculus, Information and Computation, 191:2, (145-202), Online publication date: 15-Jun-2004.
- Despeyroux T Practical semantic analysis of web sites and documents Proceedings of the 13th international conference on World Wide Web, (685-693)
- Arenas M and Libkin L (2004). A normal form for XML documents, ACM Transactions on Database Systems, 29:1, (195-232), Online publication date: 1-Mar-2004.
- Hughes D and Shmatikov V (2004). Information hiding, anonymity and privacy: a modular approach, Journal of Computer Security, 12:1, (3-36), Online publication date: 1-Jan-2004.
- Menon V, Pingali K and Mateev N (2003). Fractal symbolic analysis, ACM Transactions on Programming Languages and Systems, 25:6, (776-813), Online publication date: 1-Nov-2003.
- Lynch N, Segala R and Vaandrager F (2003). Hybrid I/O automata, Information and Computation, 185:1, (105-157), Online publication date: 25-Aug-2003.
- Khasidashvili Z and Glauert J Stable computational semantics of conflict-free rewrite systems (partial orders with duplication) Proceedings of the 14th international conference on Rewriting techniques and applications, (467-482)
- Levin M and Pierce B (2003). TinkerType: a language for playing with formal systems, Journal of Functional Programming, 13:2, (295-316), Online publication date: 1-Mar-2003.
- Schmidt D Programming language semantics Encyclopedia of Computer Science, (1463-1466)
- PašaliΕ E, Taha W and Sheard T Tagless staged interpreters for typed languages Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, (218-229)
- PašaliΕ E, Taha W and Sheard T (2002). Tagless staged interpreters for typed languages, ACM SIGPLAN Notices, 37:9, (218-229), Online publication date: 17-Sep-2002.
- Gabbay M and Pitts A (2002). A New Approach to Abstract Syntax with Variable Binding, Formal Aspects of Computing, 13:3-5, (341-363), Online publication date: 1-Jul-2002.
- Arenas M and Libkin L A normal form for XML documents Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (85-96)
- Künzi H and Schellekens M (2002). On the Yoneda completion of a quasi-metric space, Theoretical Computer Science, 278:1-2, (159-194), Online publication date: 6-May-2002.
- Hennessy M (2002). A fully abstract denotational semantics for the π-calculus, Theoretical Computer Science, 278:1-2, (53-89), Online publication date: 6-May-2002.
- Nigiyan S and Avetisyan S (2002). Semantics of Untyped Functional Programs, Programming and Computing Software, 28:3, (119-126), Online publication date: 1-May-2002.
- Schmidt D Structure-preserving binary relations for program abstraction The essence of computation, (245-265)
- McDowell R and Miller D (2002). Reasoning with higher-order abstract syntax in a logical framework, ACM Transactions on Computational Logic, 3:1, (80-136), Online publication date: 1-Jan-2002.
- Sperber M (2001). Developing a stage lighting system from scratch, ACM SIGPLAN Notices, 36:10, (122-133), Online publication date: 1-Oct-2001.
- Sperber M Developing a stage lighting system from scratch Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, (122-133)
- Van Eijck J (2001). Incremental Dynamics, Journal of Logic, Language and Information, 10:3, (319-351), Online publication date: 1-Jun-2001.
- Berger M, Honda K and Yoshida N Sequentiality and the π-calculus Proceedings of the 5th international conference on Typed lambda calculi and applications, (29-45)
- Yoshida N and Hennessy M Assigning Types to Processes Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Simpson A and Plotkin G Complete Axioms for Categorical Fixed-Point Operators Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Stevenson D Exploring an information-based approach to computation and computational complexity Proceedings of the 38th annual ACM Southeast Conference, (42-50)
- Schmidt D (2000). Induction, Domains, Calculi, Higher-Order and Symbolic Computation, 13:1-2, (89-101), Online publication date: 1-Apr-2000.
- Siff M, Chandra S, Ball T, Kunchithapadam K and Reps T (1999). Coping with type casts in C, ACM SIGSOFT Software Engineering Notes, 24:6, (180-198), Online publication date: 1-Nov-1999.
- Siff M, Chandra S, Ball T, Kunchithapadam K and Reps T Coping with type casts in C Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, (180-198)
- 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.
- Bruce K Formal semantics and interpreters in a principles of programming languages course The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (331-335)
- Bruce K (1999). Formal semantics and interpreters in a principles of programming languages course, ACM SIGCSE Bulletin, 31:1, (331-335), Online publication date: 1-Mar-1999.
- Braüner T (1998). A Simple Adequate Categorical Model for PCF, II, Fundamenta Informaticae, 33:4, (339-368), Online publication date: 1-Dec-1998.
- Jacobs B, van den Berg J, Huisman M, van Berkum M, Hensel U and Tews H (1998). Reasoning about Java classes, ACM SIGPLAN Notices, 33:10, (329-340), Online publication date: 1-Oct-1998.
- Jacobs B, van den Berg J, Huisman M, van Berkum M, Hensel U and Tews H Reasoning about Java classes Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (329-340)
- Ellman T and Murata T (1998). Deductive Synthesis of Numerical Simulation Programs fromNetworks of Algebraic and Ordinary Differential Equations, Automated Software Engineering, 5:3, (291-319), Online publication date: 1-Jul-1998.
- Schmidt D (1998). Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, 10:3, (237-271), Online publication date: 1-May-1998.
- 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.
- 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)
- Smith G and Volpano D Secure information flow in a multi-threaded imperative language Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (355-364)
- Nishimura S Static typing for dynamic messages Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (266-278)
- Wand M and Sullivan G Denotational semantics using an operationally-based term model Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (386-399)
- Biswas S A demand-driven set-based analysis Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (372-385)
- Papaspyrou N (1996). A framework for programming denotational semantics in C++, ACM SIGPLAN Notices, 31:8, (16-25), Online publication date: 1-Aug-1996.
- Hillebrand G and Kanellakis P On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- Abadi M and Fiore M Syntactic Considerations on Recursive Types Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- McCusker G Games and Full Abstraction for FPC Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- Escardo M and Edalat A Real PCF extended with integration Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- Ferreira W, Hennessy M and Jeffrey A (1996). A theory of weak bisimulation for core CML, ACM SIGPLAN Notices, 31:6, (201-212), Online publication date: 15-Jun-1996.
- Ferreira W, Hennessy M and Jeffrey A A theory of weak bisimulation for core CML Proceedings of the first ACM SIGPLAN international conference on Functional programming, (201-212)
- Wong L (1995). An introduction to Remy's fast polymorphic record projection, ACM SIGMOD Record, 24:3, (34-39), Online publication date: 1-Sep-1995.
- Liu Y and Teitelbaum T Caching intermediate results for program improvement Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (190-201)
- Libkin L Normalizing incomplete databases Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (219-230)
- Wong L (1995). Polymorphic queries across sets, bags, and lists, ACM SIGPLAN Notices, 30:4, (39-44), Online publication date: 1-Apr-1995.
- Riecke J and Viswanathan R Isolating side effects in sequential languages Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-12)
- Pustejovsky J and Bouillon P On the proper role of coercion in semantic typing Proceedings of the 15th conference on Computational linguistics - Volume 2, (706-711)
- Biswas S (1994). In-place updates in the presence of control operators, ACM SIGPLAN Lisp Pointers, VII:3, (283-293), Online publication date: 1-Jul-1994.
- Biswas S In-place updates in the presence of control operators Proceedings of the 1994 ACM conference on LISP and functional programming, (283-293)
- Wong L Normal forms and conservative properties for query languages over collection types Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (26-36)
- Riecke J Delimiting the scope of effects Proceedings of the conference on Functional programming languages and computer architecture, (146-155)
- Chirimar J, Gunter C and Riecke J Proving memory management invariants for a language based on linear logic Proceedings of the 1992 ACM conference on LISP and functional programming, (139-150)
- Chirimar J, Gunter C and Riecke J (1992). Proving memory management invariants for a language based on linear logic, ACM SIGPLAN Lisp Pointers, V:1, (139-150), Online publication date: 1-Jan-1992.
- Kessel M and Atkinson C Morescient GAI for Software Engineering, ACM Transactions on Software Engineering and Methodology, 0:0
Index Terms
- Semantics of programming languages: structures and techniques
Recommendations
SEMANOL (73) a metalanguage for programming the semantics of programming languages
SEMANOL is a practical programming system for writing readable formal specifications of the syntax and semantics of programming languages. SEMANOL is based on a theory of semantics which embraces algorithmic (operational) and extensional (input/output) ...
Formal Semantics of Programming Languages
These notes give an overview of the main frameworks that have been developed for specifying the formal semantics of programming languages. Some of the pragmatic aspects of semantic descriptions are discussed, including modularity, and potential ...
Operational semantics of programming languages
Proceedings of ACM conference on Proving assertions about programsA framework is developed for the operational characterization of the semantics of computational formalisms such as programming languages, digital computers and automata. Operational semantics is contrasted with input-output semantics and it is shown ...