Runtime verificationRuntime verification is a computing system analysis and execution approach based on extracting information from a running system and using it to detect and possibly react to observed behaviors satisfying or violating certain properties. Some very particular properties, such as datarace and deadlock freedom, are typically desired to be satisfied by all systems and may be best implemented algorithmically. Other properties can be more conveniently captured as formal specifications.
Cosmological argumentA cosmological argument, in natural theology, is an argument which claims that the existence of God can be inferred from facts concerning causation, explanation, change, motion, contingency, dependency, or finitude with respect to the universe or some totality of objects. A cosmological argument can also sometimes be referred to as an argument from universal causation, an argument from first cause, the causal argument, or prime mover argument.
Advanced Encryption StandardThe Advanced Encryption Standard (AES), also known by its original name Rijndael (ˈrɛindaːl), is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001. AES is a variant of the Rijndael block cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process. Rijndael is a family of ciphers with different key and block sizes.
Private propertyPrivate property is a legal designation for the ownership of property by non-governmental legal entities. Private property is distinguishable from public property, which is owned by a state entity, and from collective or cooperative property, which is owned by one or more non-governmental entities. Private property is foundational to capitalism, an economic system based on the private ownership of the means of production and their operation for profit.
Procedural knowledgeProcedural knowledge (also known as knowing-how, and sometimes referred to as practical knowledge, imperative knowledge, or performative knowledge) is the knowledge exercised in the performance of some task. Unlike descriptive knowledge (also known as declarative knowledge, propositional knowledge or "knowing-that"), which involves knowledge of specific facts or propositions (e.g. "I know that snow is white"), procedural knowledge involves one's ability to do something (e.g. "I know how to change a flat tire").
Title (property)In property law, title is an intangible construct representing a bundle of rights in (to) a piece of property in which a party may own either a legal interest or equitable interest. The rights in the bundle may be separated and held by different parties. It may also refer to a formal document, such as a deed, that serves as evidence of ownership. Conveyance of the document (transfer of title to the property) may be required in order to transfer ownership in the property to another person.
Interactive proof systemIn computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest.
Proof assistantIn computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human-machine collaboration. This involves some sort of interactive proof editor, or other interface, with which a human can guide the search for proofs, the details of which are stored in, and some steps provided by, a computer. A recent effort within this field is making these tools use artificial intelligence to automate the formalization of ordinary mathematics.
Teleological argumentThe teleological argument (from τέλος; also known as physico-theological argument, argument from design, or intelligent design argument) is an argument for the existence of God or, more generally, that complex functionality in the natural world which looks designed is evidence of an intelligent creator. The earliest recorded versions of this argument are associated with Socrates in ancient Greece, although it has been argued that he was taking up an older argument.
Community organizingCommunity organizing is a process where people who live in proximity to each other or share some common problem come together into an organization that acts in their shared self-interest. Unlike those who promote more-consensual community building, community organizers generally assume that social change necessarily involves conflict and social struggle in order to generate collective power for the powerless. Community organizing has as a core goal the generation of durable power for an organization representing the community, allowing it to influence key decision-makers on a range of issues over time.
Learning with errorsIn cryptography, Learning with errors (LWE) is a mathematical problem that is widely used in cryptography to create secure encryption algorithms. It is based on the idea of representing secret information as a set of equations with errors. In other words, LWE is a way to hide the value of a secret by introducing noise to it. In more technical terms, it refers to the computational problem of inferring a linear -ary function over a finite ring from given samples some of which may be erroneous.
Dynamic program analysisDynamic program analysis is analysis of computer software that involves executing the program in question (as opposed to static program analysis, which does not). Dynamic program analysis includes familiar techniques from software engineering such as unit testing, debugging, and measuring code coverage, but also includes lesser-known techniques like program slicing and invariant inference. Dynamic program analysis is widely applied in security in the form of runtime memory error detection, fuzzing, dynamic symbolic execution, and taint tracking.
