Sciweavers

3713 search results - page 81 / 743
» Constructing a Calculus of Programs
Sort
View
141
Voted
VL
2002
IEEE
118views Visual Languages» more  VL 2002»
15 years 8 months ago
Novice Comprehension of Programs Using Task-Specific and Non-Task-Specific Constructs
This study examines the comprehension and modification by novices of programs written with taskspecific and non-task-specific constructs. Teachers who write programs for use in th...
Alec Engebretson, Susan Wiedenbeck
TABLEAUX
2009
Springer
15 years 7 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
JLP
2010
142views more  JLP 2010»
14 years 9 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 3 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
LOPSTR
2004
Springer
15 years 8 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski