{"file":[{"content_type":"application/pdf","file_size":487617,"file_id":"1313","file_name":"498-WonischSchremmerWehrheim2013.pdf","date_updated":"2018-03-15T13:42:30Z","success":1,"date_created":"2018-03-15T13:42:30Z","relation":"main_file","access_level":"closed","creator":"florida"}],"series_title":"LNCS","user_id":"477","date_updated":"2022-01-06T07:01:32Z","language":[{"iso":"eng"}],"page":"912-927","file_date_updated":"2018-03-15T13:42:30Z","title":"Programs from Proofs – A PCC Alternative","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"ddc":["040"],"abstract":[{"lang":"eng","text":"Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space."}],"author":[{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"},{"full_name":"Schremmer, Alexander","first_name":"Alexander","last_name":"Schremmer"},{"last_name":"Wehrheim","first_name":"Heike","id":"573","full_name":"Wehrheim, Heike"}],"citation":{"chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs – A PCC Alternative.” In Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 912–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-39799-8_65.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs from Proofs – A PCC Alternative}, DOI={10.1007/978-3-642-39799-8_65}, booktitle={Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={912–927}, collection={LNCS} }","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,” in Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative. In: Proceedings of the 25th International Conference on Computer Aided Verification (CAV). LNCS. ; 2013:912-927. doi:10.1007/978-3-642-39799-8_65","apa":"Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Programs from Proofs – A PCC Alternative. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV) (pp. 912–927). https://doi.org/10.1007/978-3-642-39799-8_65","mla":"Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–27, doi:10.1007/978-3-642-39799-8_65."},"has_accepted_license":"1","publication":"Proceedings of the 25th International Conference on Computer Aided Verification (CAV)","_id":"498","status":"public","type":"conference","doi":"10.1007/978-3-642-39799-8_65","year":"2013","date_created":"2017-10-17T12:42:29Z","department":[{"_id":"77"}]}