A type system for counting instances of software components

DOI10.1016/j.tcs.2012.07.032zbMath1252.68201OpenAlexW2038264311WikidataQ59238601 ScholiaQ59238601MaRDI QIDQ1758151

Xianqiang Yang

Publication date: 8 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.032

zbMATH Keywords

process algebradeficit types

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs ⋮ A Type System for Usage of Software Components

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Region-based memory management
• A calculus of communicating systems
• A syntactic approach to type soundness
• A structural approach to operational semantics
• Recursion and dynamic data-structures in bounded space
• Uniqueness typing for resource management in message-passing concurrency
• Static prediction of heap space usage for first-order functional programs
• A Type System for Usage of Software Components
• Process algebra for synchronous communication
• Counting the Cost in the Picalculus (Extended Abstract)
• Resource bound certification
• Theoretical Aspects of Computing – ICTAC 2005
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Programming Languages and Systems

This page was built for publication: A type system for counting instances of software components