Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fully abstract model for concurrent constraint programming
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Randomized algorithms
Stochastic interaction and linear logic
Proceedings of the workshop on Advances in linear logic
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Usage counting analysis for lazy functional languages
Information and Computation
Implementing randomised algorithms in constraint logic programming
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Probabilistic Concurrent Constraint Programming
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
An Operational Semantics for Probabilistic Concurrent Constraint Programming
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
We investigate notions of observable behaviour of programs which include quantitative aspects of computation along with the most commonly assumed qualitative ones. We model these notions by means of a transition system where transitions occur with a given probability and an associated 'cost' expressing some complexity measure (e.g. running time or, in general, resources consumption). The addition of these quantities allows for a natural formulation of the average behaviour of a program, whose specification and analysis is particularly important in the study of system performance and reliability. It also allows for an average-case analysis of programs' complexity, which can be seen as a semantical counterpart of the average-case asymptotic analysis of algorithms. We base our model on the Concurrent Constraint Programming (CCP) paradigm and we argue that it can be an appropriate base for further developments oriented to the analysis and verification of average properties.