CSL-LICS '14 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)
Concepts inTrade-off analysis meets probabilistic model checking
Trade-off
A trade-off (or tradeoff) is a situation that involves losing one quality or aspect of something in return for gaining another quality or aspect. It implies a decision to be made with full comprehension of both the upside and downside of a particular choice. And you are giving something away to get something back.
more from Wikipedia
Model checking
In computer science, model checking refers to the following problem: Given a model of a system, test automatically whether this model meets a given specification. Typically, the systems one has in mind are hardware or software systems, and the specification contains safety requirements such as the absence of deadlocks and similar critical states that can cause the system to crash. Model checking is a technique for automatically verifying correctness properties of finite-state systems.
more from Wikipedia
Analysis of algorithms
In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps or storage locations (space complexity).
more from Wikipedia
Utility
In economics, utility is a representation of preferences over some set of goods and services. Preferences have a utility representation so long as they are transitive, complete, and continuous. Utility is usually applied by economists in such constructs as the indifference curve, which plot the combination of commodities that an individual or a society would accept to maintain a given level of satisfaction.
more from Wikipedia
Conditional probability
In probability theory, the conditional probability of given is the probability of if is known to occur (or have occurred. ) It is commonly denoted, and sometimes . (The vertical line should not be mistaken for logical OR. ) can be visualised as the probability of event when the sample space is restricted to event .
more from Wikipedia
Formula
In mathematics, a formula is an entity constructed using the symbols and formation rules of a given logical language. In science, a specific formula is a concise way of expressing information symbolically as in a mathematical or chemical formula. The plural of formula can be spelled either formulae (like the original Latin) for mathematical or scientific senses, or formulas for more general senses.
more from Wikipedia
Computation tree logic
Computation tree logicĀ (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realised. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers which determine if a given artifact possesses safety or liveness properties.
more from Wikipedia
Statistical model
A statistical model is a formalization of relationships between variables in the form of mathematical equations. A statistical model describes how one or more random variables are related to one or more random variables. The model is statistical as the variables are not deterministically but stochastically related. In mathematical terms, a statistical model is frequently thought of as a pair where is the set of possible observations and the set of possible probability distributions on .
more from Wikipedia