BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
code (21)
proof (20)
approach (7)
adder (6)
architectur (5)

Stem carri$ (all stems)

43 papers:

SPLCSPLC-2015-McGeeM #architecture #composition #cyber-physical
Composition of proof-carrying architectures for cyber-physical systems (ETM, JDM), pp. 419–426.
CASECASE-2014-ChuHJKKJC #smarttech
The experiments of wearable robot for carrying heavy-weight objects of shipbuilding works (GC, JH, DHJ, DK, SK, SJ, JC), pp. 978–983.
CASECASE-2014-MurookaNNKOI #learning #physics #scalability
Manipulation strategy learning for carrying large objects based on mapping from object physical property to object manipulation action in virtual environment (MM, SN, SN, YK, KO, MI), pp. 263–270.
HCIDUXU-ELAS-2014-DaggeF
The HARSim Application to the Task of Carrying School Supplies (RD, EF), pp. 653–661.
STOCSTOC-2013-BitanskyCCT #composition #recursion
Recursive composition and bootstrapping for SNARKS and proof-carrying data (NB, RC, AC, ET), pp. 111–120.
HCIDHM-SET-2013-KawabataMYKKGH #evaluation
Effect Evaluation of Recreational Coloring Carried Out at Pay Nursing Home (SK, NM, AY, YK, NK, AG, HH), pp. 214–222.
RERE-2013-NistalaK #analysis #approach #consistency #requirements #validation
An approach to carry out consistency analysis on requirements: Validating and tracking requirements through a configuration structure (PN, PK), pp. 320–325.
DATEDATE-2012-DuVM #latency #performance #reliability
High performance reliable variable latency carry select addition (KD, PJV, KM), pp. 1257–1262.
KMISKMIS-2012-VanharantaK #ontology
Strategy Needs Structure — Structure Needs Ontologies — Dynamic Ontologies Carry Meanings (HV, JK), pp. 261–264.
ASEASE-2010-TaleghaniA
Search-carrying code (AT, JMA), pp. 367–376.
DATEDATE-2010-LauLCB #probability
A general mathematical model of probabilistic ripple-carry adders (MSKL, KVL, YCC, AB), pp. 1100–1105.
SACSAC-2008-VargunM
Code-carrying theory (AV, DRM), pp. 376–383.
SACSAC-2007-Hamid #memory management #runtime
Integrating a certified memory management runtime with proof-carrying code (NAH), pp. 1526–1533.
CHICHI-2006-LudfordFRWT #functional
Because I carry my cell phone anyway: functional location-based reminder applications (PJL, DF, KR, KW, LGT), pp. 889–898.
ICPRICPR-v4-2006-YuTT #framework #recognition
A Framework for Evaluating the Effect of View Angle, Clothing and Carrying Condition on Gait Recognition (SY, DT, TT), pp. 441–444.
LOPSTRLOPSTR-2006-WinwoodKC #automation #monitoring #on the #synthesis
On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors (SW, GK, MMTC), pp. 111–126.
ICLPICLP-2006-AlbertAPH
Reduced Certificates for Abstraction-Carrying Code (EA, PAS, GP, MVH), pp. 163–178.
PPDPPPDP-2005-HermenegildoALP #abstraction
Abstraction carrying code and resource-awareness (MVH, EA, PLG, GP), pp. 1–11.
RTARTA-2005-Felty #approach #semantics #tutorial
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code (APF), pp. 394–406.
TLCATLCA-2005-Felty #approach #semantics #tutorial
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract (APF), p. 10.
DATEDATE-DF-2004-CilardoMRS #composition #configuration management #hardware
Carry-Save Montgomery Modular Exponentiation on Reconfigurable Hardware (AC, AM, LR, GPS), pp. 206–211.
DATEDATE-v2-2004-SogomonyanMOG #self
A New Self-Checking Sum-Bit Duplicated Carry-Select Adder (ESS, DM, VO, MG), pp. 1360–1361.
PEPMPEPM-2004-Morrisett #question #what
Invited talk: what’s the future for proof-carrying code? (JGM), p. 203.
PPDPPPDP-2004-Morrisett #question #what
Invited talk: what’s the future for proof-carrying code? (JGM), p. 5.
SACSAC-2004-CesariniMT #process #workflow
Carrying on the e-learning process with a workflow management engine (MC, MM, RT), pp. 940–945.
TACASTACAS-2003-Lee #case study #experience #what
What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code (PL0), p. 1.
SOSPSOSP-2003-SekarVBBD #approach #execution
Model-carrying code: a practical approach for safe execution of untrusted applications (RS, VNV, SB, SB, DCD), pp. 15–28.
CAiSECAiSE-2002-PontieriUZ #approach #data flow #integration
An Approach for Synergically Carrying out Intensional and Extensional Integration of Data Sources Having Different Formats (LP, DU, EZ), pp. 752–756.
CADECADE-2002-BernardL #logic
Temporal Logic for Proof-Carrying Code (AB, PL), pp. 31–46.
CADECADE-2002-SchneckN #approach #scalability
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code (RRS, GCN), pp. 47–62.
LICSLICS-2002-HamidSTMN #approach
A Syntactic Approach to Foundational Proof-Carrying Code (NAH, ZS, VT, SM, ZN), pp. 89–100.
DACDAC-2001-YuYW #representation #synthesis #using
Signal Representation Guided Synthesis Using Carry-Save Adders For Synchronous Data-path Circuits (ZY, MLY, ANWJ), pp. 456–461.
FLOPSFLOPS-2001-Necula #architecture #scalability
A Scalable Architecture for Proof-Carrying Code (GCN), pp. 21–39.
LICSLICS-2001-Appel
Foundational Proof-Carrying Code (AWA), pp. 247–256.
DACDAC-2000-YuKW #representation
The use of carry-save representation in joint module selection and retiming (ZY, KYK, ANWJ), pp. 768–773.
PPDPPPDP-2000-Necula #design #implementation
Proof-carrying code: design, implementation and applications (abstract) (GCN), pp. 175–177.
PADLPADL-2000-Lee
Production-Quality Proof-Carrying Code (PL0), p. 325.
POPLPOPL-2000-AppelF #semantics
A Semantic Model of Types and Machine Instuctions for Proof-Carrying Code (AWA, APF), pp. 243–253.
CAVCAV-2000-ColbyLN #architecture #java
A Proof-Carrying Code Architecture for Java (CC, PL, GCN), pp. 557–560.
WICSAWICSA-1999-Riemenschneider #architecture #correctness
Checking the Correctness of Architectural Transformation Steps via Proof-Carrying Architectures (RAR), pp. 65–82.
DACDAC-1998-KimJT #optimisation #using
Arithmetic Optimization Using Carry-Save-Adders (TK, WJ, SWKT), pp. 433–438.
POPLPOPL-1997-Necula
Proof-Carrying Code (GCN), pp. 106–119.
DACDAC-1990-Fishburn #heuristic #how #logic
A Depth-Decreasing Heuristic for Combinational Logic: Or How To Convert a Ripple-Carry Adder Into A Carry-Lookahead Adder Or Anything in-between (JPF), pp. 361–364.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.