Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department

Source URL: qav.comlab.ox.ac.uk

• Dynamic programming
• Markov processes
• Stochastic control
• Markov decision process
• Approximation algorithms
• Probability
• Computational complexity theory

Automated Deduction for Verification Natarajan Shankar SRI International Automated deduction uses computation to perform symbolic logical reasoning. It has been a core technology for program verification from the very be

Source URL: dream.inf.ed.ac.uk

• Logic
• Mathematical logic
• Mathematics
• Model theory
• Propositional calculus
• Logic in computer science
• Logical truth
• Linear temporal logic
• First-order logic
• Well-formed formula
• Interpretation
• Intuitionistic logic

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, Fo

Source URL: staff.bath.ac.uk

• Theoretical computer science
• Logic
• Logic in computer science
• Mathematics
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Uninterpreted function
• Satisfiability
• Solver

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces ´ Erika Abrah´ am1 , John Abbott10 , Bernd Becker2 , Anna M. Bigatti3 , Martin Brain9 , Alessandro Cimatti4 , James H. Davenport5 ,

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic in computer science
• Computational complexity theory
• Formal methods
• Mathematics
• Electronic design automation
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Model checking

Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) The Design and Implementation of Typed Scheme: From Scripts to Programs? Sam Tobin-Hochstadt · Matthias Felleisen

Source URL: homes.sice.indiana.edu

• Type theory
• Software engineering
• Programming language theory
• Computing
• Scheme
• System F
• Type system
• HindleyMilner type system
• Racket
• Boolean data type
• Macro
• Typing environment

Ev3: A Library for Symbolic Computation in C++ using n-ary Trees Leo Liberti ´ LIX, Ecole Polytechnique, 91128 Palaiseau, France

Source URL: www.enseignement.polytechnique.fr

Symbolic Computation of Differential Equivalences ∗ Ar tifact

Source URL: blog.inf.ed.ac.uk

High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment Xin Li Ontario Research Center for Computer Algebra University of Western Ontario London, Ontario, Canada

Source URL: cs.uwaterloo.ca

Quahibo Hindusu Betti Bleyer }er Azwrbaycan Internw]nl jurnal\n\n Yaz, 2004-c^ il burax\l\]\ndan g=t^r^lm^]d^r. Bir dwfw Kolumbiya cwngwlliyinin dwrinliklwrindw, Wn yax\n yoldan iki g^nl^k mwsafwdw, G^ndwn dwrisi [atlam\

Source URL: azeri.org