|
Kenneth L. McMillan
Kenneth L. McMillan is an American computer scientist working in the area of formal methods, logic, and programming languages. He is a professor in the computer science department at the University of Texas at Austin, where he holds the Admiral B.R. Inman Centennial Chair in Computing Theory. Career McMillan received his Ph.D. from Carnegie Mellon University in 1992, under Edmund M. Clarke. He is credited to have invented symbolic model checking during his thesis work, which won him the 1992 ACM Doctoral Dissertation Award, the highest doctoral dissertation prize awarded by the Association for Computing Machinery (ACM). He also won the 1998 ACM Paris Kanellakis Award for Theory and Practice jointly with Randal Bryant, Edmund Clarke, and E. Allen Emerson for work on symbolic model checking. McMillan subsequently worked at Bell Labs, Cadence Berkeley Labs, and was a Principal Researcher at Microsoft Research, Redmond before joining the faculty of University of Texas at Austi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edmund Clarke 2 FLoC 2006
Edmund is a masculine given name or surname in the English language. The name is derived from the Old English elements ''ēad'', meaning "prosperity" or "riches", and ''mund'', meaning "protector". Persons named Edmund include: People Kings and nobles *Edmund the Martyr (died 869 or 870), king of East Anglia *Edmund I (922–946), King of England from 939 to 946 * Edmund Ironside (989–1016), also known as Edmund II, King of England in 1016 * Edmund of Scotland (after 1070 – after 1097) * Edmund Crouchback (1245–1296), son of King Henry III of England and claimant to the Sicilian throne *Edmund, 2nd Earl of Cornwall (1249–1300), earl of Cornwall; English nobleman of royal descent *Edmund of Langley, 1st Duke of York (1341–1402), son of King Edward III of England * Edmund Tudor, earl of Richmond (1430–1456), English and Welsh nobleman *Edmund, Prince of Schwarzenberg (1803–1873), the last created Austrian field marshal of the 19th century In religion * Saint Edmund ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cadence Design Systems
Cadence Design Systems, Inc. (stylized as cādence), headquartered in San Jose, California, is an American multinational computational software company, founded in 1988 by the merger of SDA Systems and ECAD, Inc. The company produces software, hardware and silicon structures for designing integrated circuits, systems on chips (SoCs) and printed circuit boards. History Origins Cadence Design Systems began as an electronic design automation (EDA) company, formed by the 1988 merger of Solomon Design Automation (SDA), co-founded in 1983 by Richard Newton, Alberto Sangiovanni-Vincentelli and James Solomon, and ECAD, a public company co-founded by Ping Chao, Glen Antle and Paul Huang in 1982. SDA's CEO Joseph Costello was appointed as CEO of the newly combined company. Executive leadership Following the resignation of Cadence's original CEO Joe Costello in 1997, Jack Harding was appointed CEO. Ray Bingham was named CEO in 1999. In 2004, Mike Fister became Cadence's new CEO. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Computer Scientists
American(s) may refer to: * American, something of, from, or related to the United States of America, commonly known as the "United States" or "America" ** Americans, citizens and nationals of the United States of America ** American ancestry, people who self-identify their ancestry as "American" ** American English, the set of varieties of the English language native to the United States ** Native Americans in the United States, indigenous peoples of the United States * American, something of, from, or related to the Americas, also known as "America" ** Indigenous peoples of the Americas * American (word), for analysis and history of the meanings in various contexts Organizations * American Airlines, U.S.-based airline headquartered in Fort Worth, Texas * American Athletic Conference, an American college athletic conference * American Recordings (record label), a record label previously known as Def American * American University, in Washington, D.C. Sports teams Soccer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Aided Verification
In computer science, the International Conference on Computer-Aided Verification (CAV) is an annual academic conference on the theory and practice of computer-aided formal analysis of software and hardware systems, broadly known as formal methods. It is one of the highest-ranked conferences in computer science. Among the important results originally published in CAV are breakthrough techniques in model checking, such as Counterexample-Guided Abstraction Refinement (CEGAR) and partial order reduction. The first CAV was held in 1989 in Grenoble, France. The CAV proceedings (1989-present) are published by Springer Science+Business Media and are open access. See also * List of computer science conferences * Symposium on Logic in Computer Science * European Joint Conferences on Theory and Practice of Software External links *bibliography for CAVat DBLP DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semiconductor Research Corporation
Semiconductor Research Corporation (SRC), commonly known as SRC, is a high-technology research consortium active in the semiconductor industry. It is a leading semiconductor research consortium. Todd Younkin is the incumbent president and chief executive officer of the company. The consortium comprises more than twenty-five companies and government agencies with more than a hundred universities under contract performing research. History SRC was founded in 1982 as a consortium to fund research by semiconductor companies. In the past, it has funded university research projects in hardware and software co-design, new architectures, circuit design, transistors, memories, interconnects, and materials and has sponsored over 15,000 PhD students. Research SRC has funded research in areas such as automotive, advanced memory technologies, logic and processing, advanced packaging, edge intelligence, and communications. Programs Joint University Microelectronics Program It is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Logic In Computer Science
The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical logic. Extended versions of selected papers of each year's conference appear in renowned international journals such as Logical Methods in Computer Science and ACM Transactions on Computational Logic. History LICS was originally sponsored solely by the IEEE, but as of the 2014 founding of the ACM Special Interest Group on Logic and Computation LICS has become the flagship conference of SIGLOG, under the joint sponsorship of ACM and IEEE. From the first installment in 1988 until 2013, the cover page of the conference proceedings has featured an artwork entitled ''Irrational Tiling by Logical Quantifiers'', by Alvy Ray Smith. Since 1995, each year the '' Kleene award'' is given to the best student paper. In addition, since 2006, the ''LICS Test-of-Time Award'' is given annually to one among the twenty-year-old LIC ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Principles Of Programming Languages
The annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) is an academic conference in the field of computer science, with focus on fundamental principles in the design, definition, analysis, and implementation of programming languages, programming systems, and programming interfaces. The venue is jointly sponsored by two Special Interest Groups of the Association for Computing Machinery: SIGPLAN and SIGACT. POPL ranks as A* (top 4%) in the CORE conference ranking. The proceedings of the conference are hosted at the ACM Digital Library. They were initially under a paywall, but since 2017 they are published in open access as part of the journal ''Proceedings of the ACM on Programming Languages'' (PACMPL). Affiliated events * Declarative Aspects of Multicore Programming (DAMP) * Foundations and Developments of Object-Oriented Languages (FOOL/WOOD) * Partial Evaluation and Semantics-Based Program Manipulation (PEPM) * Practical Applications of Decla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Craig Interpolation
In mathematical logic, Craig's interpolation theorem is a result about the relationship between different logical theories. Roughly stated, the theorem says that if a formula φ implies a formula ψ, and the two have at least one atomic variable symbol in common, then there is a formula ρ, called an interpolant, such that every non-logical symbol in ρ occurs both in φ and ψ, φ implies ρ, and ρ implies ψ. The theorem was first proved for first-order logic by William Craig in 1957. Variants of the theorem hold for other logics, such as propositional logic. A stronger form of Craig's interpolation theorem for first-order logic was proved by Roger Lyndon in 1959; the overall result is sometimes called the Craig–Lyndon theorem. Example In propositional logic, let ::: \varphi = \lnot(P \land Q) \to (\lnot R \land Q) ::: \psi = (S \to P) \lor (S \to \lnot R) . Then \varphi tautologically implies \psi. This can be verified by writing \varphi in conjunctive normal form: : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Model Checking
In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of livelock) as well as safety requirements (such as avoidance of states representing a system crash). In order to solve such a problem algorithmically, both the model of the system and its specification are formulated in some precise mathematical language. To this end, the problem is formulated as a task in logic, namely to check whether a structure satisfies a given logical formula. This general concept applies to many kinds of logic and many kinds of structures. A simple model-checking problem consists of verifying whether a formula in the propositional logic is satisfied by a given structure. Overview Property checking is used for verification when two d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NuSMV
NuSMV is a reimplementation and extension of SMV symbolic model checker, the first model checking tool based on Binary Decision Diagrams (BDDs).K.L. McMillan. Symbolic model checking. In Kluwer Academic Publ.,1993. The tool has been designed as an open architecture for model checking. It is aimed at reliable verification of industrially sized designs, for use as a backend for other verification tools and as a research tool for formal verification techniques. NuSMV has been developed as a joint project between ITC-IRST ( Istituto Trentino di Cultura in Trento, Italy), Carnegie Mellon University, the University of Genoa and the University of Trento. NuSMV 2, version 2 of NuSMV, inherits all the functionalities of NuSMV. Furthermore, it combines BDD-based model checking with SAT-based model checking.A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for Construction and Analysis of Systems, In TACAS’99, March 1999. It is m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Decision Diagram
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression. Similar data structures include negation normal form (NNF), Zhegalkin polynomials, and propositional directed acyclic graphs (PDAG). Definition A Boolean function can be represented as a rooted, directed, acyclic graph, which consists of several (decision) nodes and two terminal nodes. The two terminal nodes are labeled 0 (FALSE) and 1 (TRUE). Each (decision) node u is labeled by a Boolean variable x_i and has two child nodes called low child and high child. The edge from node u to a low (or high) child represents an assignment of the value FALSE (or TRUE, respectively) to variable x_i. Such a BDD i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Microsoft
Microsoft Corporation is an American multinational corporation, multinational technology company, technology corporation producing Software, computer software, consumer electronics, personal computers, and related services headquartered at the Microsoft Redmond campus located in Redmond, Washington, United States. Its best-known software products are the Microsoft Windows, Windows line of operating systems, the Microsoft Office Productivity software#Office suite, suite, and the Internet Explorer and Microsoft Edge, Edge web browsers. Its flagship hardware products are the Xbox video game consoles and the Microsoft Surface lineup of touchscreen personal computers. Microsoft ranked No. 21 in the 2020 Fortune 500 rankings of the largest United States corporations by total revenue; it was the world's List of the largest software companies, largest software maker by revenue as of 2019. It is one of the Big Tech, Big Five American information technology companies, alongside Alphabet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Model Checking")
