Worst-case input generation for concurrent programs under non-monotone resource metrics

DOI10.46298/LMCS-20(4:26)2024MaRDI QIDQ7034602zbMATH OpenFDO

Authors Long H. Pham, Jan Hoffmann

Publication date 31 January 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-20(4:26)2024

zbMATH Keywords

amortized analysisconcurrent programmingresource analysissession typesworst-case input generation

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A combination framework for complexity
• Amortised resource analysis and typed polynomial interpretations
• Amortized Computational Complexity
• Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
• Analysing the complexity of functional programs: higher-order meets first-order
• Automatic Static Cost Analysis for Parallel Programs
• Cost recurrences for DML programs
• Exponential automatic amortized resource analysis
• Higher-order processes, functions, and sessions: a monadic integration
• Lightweight semiformal time complexity analysis for purely functional data structures
• Linearizing intuitionistic implication
• Manifest deadlock-freedom for shared session types
• Mechanical program analysis
• Multiparty asynchronous session types
• Polarized Substructural Session Types
• Programming languages and systems. 16th European symposium of programming, ESOP 2007, held as part of the joint European conferences on theory and practice of software, ETAPS 2007, Braga, Portugal, March 24 -- April 1, 2007. Proceedings.
• Propositions as sessions
• Relating state-based and process-based concurrency through linear logic
• Relational cost analysis
• Resource bound certification
• Session types as intuitionistic linear propositions
• SPEED: precise and efficient static estimation of program computational complexity
• Static prediction of heap space usage for first-order functional programs
• Subtyping for session types in the pi calculus
• Time, clocks, and the ordering of events in a distributed system
• Work analysis with resource-aware session types

This page was built for publication: Worst-case input generation for concurrent programs under non-monotone resource metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034602)