Results 21 to 30 of about 3,258,688 (158)
"Boring formal methods" or "Sherlock Holmes deduction methods"?
, 2016 This paper provides an overview of common challenges in teaching of logic and formal methods to Computer Science and IT students. We discuss our experiences from the course IN3050: Applied Logic in Engineering, introduced as a "logic for everybody ...
BF Sherman +11 more
core +1 more source
Higher-Order Termination: from Kruskal to Computability [PDF]
, 2006 Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination).
C. Borralleras +13 more
core +9 more sources
Ten Research Challenge Areas in Data Science [PDF]
arXiv, 2020 Although data science builds on knowledge from computer science, mathematics, statistics, and other disciplines, data science is a unique field with many mysteries to unlock: challenging scientific questions and pressing questions of societal importance.
arxiv
Oxford-style Debates in Telecommunication and Computer Science Education [PDF]
arXiv, 2022 Oxford-style debating is a well-known tool in social sciences. Such formal discussions on particular topics are widely used by historians and sociologists. However, when we try to go beyond standard thinking, it turns out that Oxford-style debating can be a great educational tool in telecommunication and computer science.
arxiv
Modal logics are coalgebraic [PDF]
, 2008 Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts.
Cirstea, Corina +4 more
core +5 more sources
ABET Accreditation: A Way Forward for PDC Education [PDF]
EduPar-21: 11th NSF/TCPP Workshop on Parallel and Distributed
Computing Education, May 2021, 2021 With parallel and distributed computing (PDC) now wide-spread, modern computing programs must incorporate PDC within the curriculum. ACM and IEEE Computer Society's Computer Science curricular guidelines have recommended exposure to PDC concepts since 2013.
arxiv
Specifying and Verifying Properties of Space - Extended Version [PDF]
, 2014 The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems distributed in ...
Ciancia, Vincenzo +3 more
core +2 more sources
De-linearizing Linearity: Projective Quantum Axiomatics From Strong Compact Closure [PDF]
, 2007 Elaborating on our joint work with Abramsky in [S. Abramsky, B. Coecke, B. (2004) A categorical semantics of quantum protocols. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press.
Coecke, Bob
core +2 more sources
, 2015 We present infinite extensive strategy profiles with perfect information and we show that replacing finite by infinite changes the notions and the reasoning tools.
Lescanne, Pierre
core +2 more sources
On Pebble Automata for Data Languages with Decidable Emptiness Problem [PDF]
, 2009 In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we introduce the so-called top view weak PA.
F. Neven +6 more
core +2 more sources